633 search results - page 13 / 127 » Locality and Hard SAT-Instances |
PODC
2012
ACM
11 years 9 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
CP
2005
Springer
14 years 29 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
IJCAI
1997
13 years 8 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...