1277 search results - page 131 / 256 » Terminating Decision Algorithms Optimally |
149
Voted
AAAI
2007
15 years 5 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
119
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
129
click to vote
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
138
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
134
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...