1191 search results - page 5 / 239 » Completeness and Performance Of The APO Algorithm |
123
click to vote
IJCAI
2003
15 years 2 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
15 years 24 days 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...
119
click to vote
ALGORITHMICA
2002
15 years 1 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...
153
click to vote
GRAPHITE
2007
ACM
15 years 5 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...
107
click to vote
ISHPC
2003
Springer
15 years 6 months 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...