17 search results - page 3 / 4 » Phase transition for Local Search on planted SAT |
IJCAI
2003
13 years 7 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
MM
2006
ACM
14 years 7 days ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
COR
2010
13 years 6 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
ICTAI
2007
IEEE
14 years 17 days ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...