Sciweavers

2005 search results - page 191 / 401
» Decisive Markov Chains
Sort
View
AIED
2011
Springer
14 years 5 months ago
Faster Teaching by POMDP Planning
Both human and automated tutors must infer what a student knows and plan future actions to maximize learning. Though substantial research has been done on tracking and modeling stu...
Anna N. Rafferty, Emma Brunskill, Thomas L. Griffi...
103
Voted
WSC
2007
15 years 4 months ago
Estimating the probability of a rare event over a finite time horizon
We study an approximation for the zero-variance change of measure to estimate the probability of a rare event in a continuous-time Markov chain. The rare event occurs when the cha...
Pieter-Tjerk de Boer, Pierre L'Ecuyer, Gerardo Rub...
ATAL
2007
Springer
15 years 8 months ago
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
WSC
2008
15 years 4 months ago
Simulation based sales forecasting on retail small stores
As the competition becomes more and more intense, many retail small store chain operators are eager to know how to evaluate new store locations quantitatively to support a scienti...
Hairong Lv, Xinxin Bai, Wen Jun Yin, Jin Dong
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 2 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan