1639 search results - page 74 / 328 » Anytime Heuristic Search |
111
click to vote
AAAI
2000
15 years 1 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
92
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
100
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
108
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...