1639 search results - page 67 / 328 » Anytime Heuristic Search |
122
Voted
IRREGULAR
1995
Springer
15 years 4 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
101
click to vote
GECCO
2007
Springer
15 years 6 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...
89
Voted
FLAIRS
2007
15 years 2 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...
103
Voted
CAISE
2009
Springer
15 years 7 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...
106
click to vote
ISHPC
2003
Springer
15 years 5 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...