1047 search results - page 8 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
AMC
2008
13 years 7 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
AUSAI
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
WABI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and...
ADC
2007
Springer
13 years 11 months ago
2007
Springer
Derived horizontal fragmentation is one of the main database distribution design techniques. Unlike primary horizontal fragmentation, the decision of derived horizontal fragmentat...