Sciweavers

1277 search results - page 135 / 256
» Terminating Decision Algorithms Optimally
Sort
View
121
Voted
AAAI
2010
15 years 5 months ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier
121
Voted
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 4 months ago
Stock trading strategies by genetic network programming with flag nodes
Genetic Network Programming (GNP) has been proposed as a graph-based evolutionary algorithm. GNP works well especially in dynamic environments due to its graph structures. In addi...
Shingo Mabu, Yan Chen, Etsushi Ohkawa, Kotaro Hira...
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
15 years 10 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...
120
Voted
TASE
2008
IEEE
15 years 3 months ago
Optimization of Joint Replacement Policies for Multipart Systems by a Rollout Framework
Maintaining an asset with life-limited parts, e.g., a jet engine or an electric generator, may be costly. Certain costs, e.g., setup cost, can be shared if some parts of the asset ...
Tao Sun, Qianchuan Zhao, Peter B. Luh, Robert N. T...
125
Voted
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm