Sciweavers

882 search results - page 20 / 177
» Local Search for Very Large SAT Problems
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ICTAI
2002
IEEE
14 years 10 days ago
DSatz: A Directional SAT Solver for Planning
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
PPDP
2010
Springer
13 years 5 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
ICIP
2005
IEEE
14 years 9 months ago
Content-based video copy detection in large databases: a local fingerprints statistical similarity search approach
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...
Alexis Joly, Carl Frélicot, Olivier Buisson
CVPR
2010
IEEE
14 years 4 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...