2108 search results - page 349 / 422 » Constrained Heuristic Search |
158
Voted
IPPS
2000
IEEE
15 years 9 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...
140
click to vote
CHI
2007
ACM
15 years 8 months 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...
136
click to vote
GECCO
2006
Springer
15 years 8 months 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...
159
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
146
Voted
AIPS
2009
15 years 5 months ago
2009
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...