1589 search results - page 63 / 318 » Multiple-Goal Heuristic Search |
120
Voted
FLAIRS
2007
15 years 5 months ago
2007
Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
127
click to vote
CAISE
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we present a heuristic approach for finding errors and possible improvements in business process models. First, we translate the information that is included in a m...
126
click to vote
ISHPC
2003
Springer
15 years 8 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...
120
Voted
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...
IJCAI
1993
15 years 4 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...