13376 search results - page 325 / 2676 » Problem Solving with |
142
click to vote
AIPS
2011
14 years 7 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
114
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
121
click to vote
AIR
2008
15 years 4 months ago
2008
This paper is concerned with taking an engineering approach towards the application of metaheuristic problem solving methods, i.e. heuristics that aim to solve a wide variety of p...
142
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
133
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...