Sciweavers

721 search results - page 143 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 7 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 8 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
DCOSS
2007
Springer
14 years 1 months ago
Distributed Coalition Formation in Visual Sensor Networks: A Virtual Vision Approach
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
Faisal Qureshi, Demetri Terzopoulos
ATAL
2003
Springer
14 years 19 days ago
Performance models for large scale multiagent systems: using distributed POMDP building blocks
Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of co...
Hyuckchul Jung, Milind Tambe
CP
2006
Springer
13 years 11 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann