1639 search results - page 260 / 328 » Anytime Heuristic Search |
CP
2003
Springer
14 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
CHI
2007
ACM
14 years 22 days ago
2007
ACM
With new technology, people can share information about everyday places they go; the resulting data helps others find and evaluate places. Recent applications like Dodgeball and S...
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...