Sciweavers

569 search results - page 34 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
15 years 4 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
AAAI
1996
14 years 11 months ago
Goal Oriented Symbolic Propagation in Bayesian Networks
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
Enrique Castillo, José Manuel Gutiér...
CN
2007
92views more  CN 2007»
14 years 9 months ago
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to oï...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...
NIPS
2004
14 years 11 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
ORL
2010
156views more  ORL 2010»
14 years 4 months ago
Advertisement allocation for generalized second-pricing schemes
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, A...