Sciweavers

829 search results - page 68 / 166
» A time aggregation approach to Markov decision processes
Sort
View
ICDE
1999
IEEE
150views Database» more  ICDE 1999»
16 years 7 months ago
Managing Distributed Memory to Meet Multiclass Workload Response Time Goals
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...
Arnd Christian König, Markus Sinnwell
AAAI
2007
15 years 8 months ago
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games
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...
Colin McMillen, Manuela M. Veloso
VTC
2007
IEEE
192views Communications» more  VTC 2007»
16 years 13 days ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...
AMAI
2006
Springer
15 years 6 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
SAB
2010
Springer
140views Optimization» more  SAB 2010»
15 years 4 months ago
A Model of Symmetry Breaking in Collective Decision-Making
Abstract. Symmetry breaking is commonly found in self-organized collective decision making. It serves an important functional role, specifically in biological and bio-inspired sys...
Heiko Hamann, Bernd Meyer, Thomas Schmickl, Karl C...