920 search results - page 37 / 184 » Generating Satisfiable Problem Instances |
111
click to vote
AAAI
2006
15 years 3 months ago
2006
Assume that we are trying to build a visual recognizer for a particular class of objects--chairs, for example--using existing induction methods. Assume the assistance of a human t...
145
Voted
CAV
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
109
click to vote
EOR
2000
15 years 2 months ago
2000
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
109
click to vote
MST
2008
15 years 2 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
134
Voted
PATAT
2000
Springer
15 years 6 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...