4377 search results - page 667 / 876 » Mass problems and randomness |
188
click to vote
GECCO
2005
Springer
16 years 23 days 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...
174
click to vote
ISAAC
2004
Springer
16 years 18 days 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...
233
click to vote
WSNA
2003
ACM
16 years 15 days ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
158
click to vote
PODS
2010
ACM
16 years 10 days ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
213
click to vote
FOCS
2002
IEEE
16 years 6 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...