1614 search results - page 66 / 323 » Breadth-First Heuristic Search |
132
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
129
click to vote
FLAIRS
2007
15 years 6 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...
138
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...
130
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...
125
click to vote
CAAN
2007
Springer
15 years 8 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...