Sciweavers

2005 search results - page 327 / 401
» Decisive Markov Chains
Sort
View
SIAMIS
2010
141views more  SIAMIS 2010»
14 years 6 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
INFOCOM
2011
IEEE
14 years 3 months ago
An analytical approach to real-time misbehavior detection in IEEE 802.11 based wireless networks
—The distributed nature of the CSMA/CA based wireless protocols, e.g., the IEEE 802.11 distributed coordinated function (DCF), allows malicious nodes to deliberately manipulate t...
Jin Tang, Yu Cheng, Weihua Zhuang
EOR
2010
110views more  EOR 2010»
14 years 12 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 6 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen