882 search results - page 25 / 177 » Local Search for Very Large SAT Problems |
115
click to vote
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
IPTPS
2005
Springer
15 years 5 months ago
2005
Springer
Tulip is an overlay for routing, searching and publish-lookup information sharing. It offers a unique combination of the advantages of both structured and unstructured overlays, t...
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
109
click to vote
PRICAI
2004
Springer
15 years 5 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
HEURISTICS
2002
14 years 11 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...