Sciweavers

111 search results - page 9 / 23
» Finding Total Unimodularity in Optimization Problems Solved ...
Sort
View
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
13 years 2 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
ICCV
2009
IEEE
13 years 5 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
CCE
2007
13 years 7 months ago
Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
Vicente Rico-Ramírez, Sergio Frausto-Hern&a...
IWPEC
2004
Springer
14 years 25 days ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...