Sciweavers

1277 search results - page 28 / 256
» Terminating Decision Algorithms Optimally
Sort
View
ICML
1999
IEEE
16 years 3 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
JUCS
2010
133views more  JUCS 2010»
14 years 9 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 6 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 6 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
IJCAI
2007
15 years 4 months ago
Average-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. Wh...
Marek Petrik, Shlomo Zilberstein