5144 search results - page 288 / 1029 » Enhancing Search with Structure |
199
click to vote
SAGA
2001
Springer
15 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
168
click to vote
LREC
2008
15 years 8 months ago
2008
OntoSelect is a dynamic web-based ontology library that harvests, analyzes and organizes ontologies published on the Semantic Web. OntoSelect allows searching as well as browsing ...
136
click to vote
AAAI
1998
15 years 8 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
210
click to vote
AAAI
2000
15 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
187
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...