Sciweavers

573 search results - page 66 / 115
» Probabilistic Parsing Strategies
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 4 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
CDC
2009
IEEE
169views Control Systems» more  CDC 2009»
14 years 2 months ago
Parametric regret in uncertain Markov decision processes
— We consider decision making in a Markovian setup where the reward parameters are not known in advance. Our performance criterion is the gap between the performance of the best ...
Huan Xu, Shie Mannor
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 10 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
CVPR
2008
IEEE
14 years 12 months ago
Physical simulation for probabilistic motion tracking
Human motion tracking is an important problem in computer vision. Most prior approaches have concentrated on efficient inference algorithms and prior motion models; however, few c...
Marek Vondrak, Leonid Sigal, Odest Chadwicke Jenki...
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
14 years 3 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka