1615 search results - page 52 / 323 » Pathology in heuristic search |
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
EVOW
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
WSC
2004
13 years 11 months ago
2004
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
AIPS
2009
13 years 11 months ago
2009
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
EUROCAST
2009
Springer
14 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...