17 search results - page 1 / 4 » Incremental Instance Generation in Local Reasoning |
CAV
2009
Springer
14 years 11 months ago
2009
Springer
CP
2005
Springer
14 years 4 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
CADE
1998
Springer
14 years 3 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
AI
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
TCAD
2008
13 years 10 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...