1529 search results - page 60 / 306 » Search Space Analysis of the Linear Ordering Problem |
AAAI
1996
13 years 9 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
WSC
2008
13 years 10 months ago
2008
A large number of operational tools exist to help researchers determine business solutions for their customers. Each individual tool serves a distinct purpose for specific types o...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
SAGA
2001
Springer
14 years 4 days 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...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...