Sciweavers

646 search results - page 80 / 130
» Generalized connected domination in graphs
Sort
View
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
13 years 10 months ago
Synchronization in networks of identical linear systems
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
Luca Scardovi, Rodolphe Sepulchre
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 8 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
ICALT
2006
IEEE
14 years 2 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ADHOCNOW
2003
Springer
14 years 2 months ago
Topology Control Problems under Symmetric and Asymmetric Power Thresholds
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madha...
IJES
2006
72views more  IJES 2006»
13 years 8 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan