882 search results - page 30 / 177 » Local Search for Very Large SAT Problems |
ECAIW
2000
Springer
15 years 4 months ago
2000
Springer
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
102
click to vote
EC
2010
14 years 11 months ago
2010
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
CP
2005
Springer
15 years 5 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...
112
click to vote
TIP
2008
14 years 11 months ago
2008
Several novel and particularly successful object and object category detection and recognition methods based on image features, local descriptions of object appearance, have recent...
AAAI
2000
15 years 1 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...