Sciweavers

213 search results - page 36 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
64
Voted
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 4 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
JCSS
2008
138views more  JCSS 2008»
14 years 9 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
15 years 4 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller
98
Voted
ATAL
2005
Springer
15 years 3 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
110
Voted
3DIM
1997
IEEE
15 years 1 months ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth