1816 search results - page 33 / 364 » A New Approach for Solving the Maximum Clique Problem |
112
click to vote
WSC
2008
15 years 2 months ago
2008
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
107
click to vote
IJCAI
2007
15 years 1 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
112
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
111
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...