1639 search results - page 68 / 328 » Anytime Heuristic Search |
100
click to vote
CAAN
2007
Springer
15 years 4 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...
75
Voted
IJCAI
1993
15 years 1 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...
106
Voted
DISOPT
2008
15 years 19 days 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...
EOR
2008
15 years 18 days 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...
94
Voted
ESWA
2007
15 years 15 days ago
2007
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...