Sciweavers

683 search results - page 111 / 137
» Coarticulation in Markov Decision Processes
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
ICML
2002
IEEE
14 years 9 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich
MOBIHOC
2008
ACM
14 years 8 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
HYBRID
2010
Springer
14 years 3 months ago
On a control algorithm for time-varying processor availability
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...
Vijay Gupta
INFOCOM
2009
IEEE
14 years 3 months ago
Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay
—In this paper, we investigate into optimal admission control policies for Heterogeneous Wireless Networks (HWN), considering an integration of wireless mesh networks with an ove...
Amin Farbod, Ben Liang