920 search results - page 21 / 184 » Generating Satisfiable Problem Instances |
IJCAI
2007
13 years 9 months ago
2007
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The computer aided diagnosis (CAD) problems of detecting
potentially diseased structures from medical images are
typically distinguished by the following challenging characterist...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
JAIR
2000
13 years 7 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
IJCAI
1997
13 years 9 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...