9 search results - page 1 / 2 » Automated Discovery of Local Search Heuristics for Satisfiab... |
EC
2008
13 years 4 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
IJCAI
2001
13 years 5 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
CP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...