Sciweavers

882 search results - page 39 / 177
» Local Search for Very Large SAT Problems
Sort
View
JAR
2000
129views more  JAR 2000»
14 years 11 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
LPNMR
2004
Springer
15 years 5 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
126
Voted
CVPR
2009
IEEE
16 years 6 months ago
Boosted Multi-Task Learning for Face Verification With Applications to Web Image and Video Search
Face verification has many potential applications including filtering and ranking image/video search results on celebrities. Since these images/videos are taken under uncontrolle...
Xiaogang Wang (MIT), Cha Zhang (Microsoft Research...
EOR
2007
90views more  EOR 2007»
14 years 11 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
AICOM
2007
61views more  AICOM 2007»
14 years 12 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck