20 search results - page 1 / 4 » Random Walk with Continuously Smoothed Variable Weights |
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
103
click to vote
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
88
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
105
click to vote
PLDI
2010
ACM
15 years 4 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...