Sciweavers

48 search results - page 2 / 10
» Local Search on Random 2 p-SAT
Sort
View
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
INFOSCALE
2006
ACM
14 years 1 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
SAT
2007
Springer
107views Hardware» more  SAT 2007»
14 years 1 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
SKG
2006
IEEE
14 years 1 months ago
IAC: Interest-Aware Caching for Unstructured P2P
The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms re...
Xucheng Luo, Zhiguang Qin, Ji Geng, Jiaqing Luo