Sciweavers

682 search results - page 113 / 137
» One-Counter Markov Decision Processes
Sort
View
ICML
2002
IEEE
16 years 1 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
110
Voted
MOBIHOC
2008
ACM
16 years 9 days 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
103
Voted
HYBRID
2010
Springer
15 years 7 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
15 years 7 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
100
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...