1603 search results - page 66 / 321 » Multi-Dimensional Heuristic Searching |
129
click to vote
ISHPC
2003
Springer
15 years 9 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...
124
click to vote
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
101
click to vote
IJCAI
1993
15 years 5 months ago
1993
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
145
Voted
DISOPT
2008
15 years 3 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
122
click to vote
EOR
2008
15 years 3 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...