2432 search results - page 203 / 487 » Degrees and choice numbers |
156
click to vote
SSS
2005
Springer
16 years 14 hour ago
2005
Springer
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
187
click to vote
WDAG
2005
Springer
16 years 11 hour ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
176
click to vote
WEA
2005
Springer
16 years 11 hour ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
141
click to vote
ANTS
2004
Springer
15 years 12 months ago
2004
Springer
We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-ra...
143
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...