3008 search results - page 582 / 602 » Independence in connected graphs |
142
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
116
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
104
click to vote
IJCINI
2007
15 years 27 days ago
2007
The Cognitive Processes of Abstraction and Formal Inferences J. A. Anderson: A Brain-Like Computer for Cognitive Software Applications: the Resatz Brain Project L. Flax: Cognitive ...
113
click to vote
BMCBI
2005
15 years 27 days ago
2005
Background: Improvements in technology have been accompanied by the generation of large amounts of complex data. This same technology must be harnessed effectively if the knowledg...