5153 search results - page 606 / 1031 » Introduction to Randomized Algorithms |
205
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
168
click to vote
MSWIM
2004
ACM
15 years 11 months ago
2004
ACM
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
195
click to vote
MIDDLEWARE
2004
Springer
15 years 11 months ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
152
click to vote
STOC
1991
ACM
15 years 9 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
176
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...