Sciweavers

2005 search results - page 344 / 401
» Decisive Markov Chains
Sort
View
ICML
2003
IEEE
16 years 19 days 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
16 years 19 days 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
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 11 days ago
Name-ethnicity classification from open sources
The problem of ethnicity identification from names has a variety of important applications, including biomedical research, demographic studies, and marketing. Here we report on th...
Anurag Ambekar, Charles B. Ward, Jahangir Mohammed...
MOBIHOC
2008
ACM
15 years 11 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
INFOCOM
2009
IEEE
15 years 6 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