1191 search results - page 5 / 239 » Completeness and Performance Of The APO Algorithm |
IJCAI
2003
13 years 9 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
SIAMDM
1998
13 years 7 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
GRAPHITE
2007
ACM
13 years 11 months ago
2007
ACM
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
ISHPC
2003
Springer
14 years 28 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...