Sciweavers

829 search results - page 90 / 166
» A time aggregation approach to Markov decision processes
Sort
View
PADS
1999
ACM
15 years 10 months ago
Shock Resistant Time Warp
In an attempt to cope with time-varying workload, traditional adaptive Time Warp protocols are designed to react in response to performance changes by altering control parameter c...
Alois Ferscha, James Johnson
ICDE
2010
IEEE
198views Database» more  ICDE 2010»
16 years 6 months ago
Q-Cop: Avoiding Bad Query Mixes to Minimize Client Timeouts Under Heavy Loads
In three-tiered web applications, some form of admission control is required to ensure that throughput and response times are not significantly harmed during periods of heavy load....
Sean Tozer, Tim Brecht, Ashraf Aboulnaga
AIPS
2008
15 years 8 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
AAAI
2006
15 years 7 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
UAI
2008
15 years 7 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht