5580 search results - page 843 / 1116 » Randomized priority algorithms |
128
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
119
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
106
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
133
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
137
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...