1277 search results - page 43 / 256 » Terminating Decision Algorithms Optimally |
143
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
134
click to vote
TEC
2008
15 years 2 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
144
click to vote
COCO
1995
Springer
15 years 6 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
109
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
151
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...