1749 search results - page 174 / 350 » Conditional colorings of graphs |
197
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
204
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
186
click to vote
CAAN
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
171
click to vote
COLT
2005
Springer
16 years 5 days ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivated...
136
click to vote
FORTE
1998
15 years 8 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...