Sciweavers

1305 search results - page 110 / 261
» An Optimization Algorithm Based on Active and Instance-Based...
Sort
View
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
16 years 4 days ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
154
Voted
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 10 months ago
Distributed coverage games for mobile visual sensors (II) : Reaching the set of global optima
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez
JMLR
2010
148views more  JMLR 2010»
15 years 12 days ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
164
Voted
COLT
2005
Springer
15 years 11 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
150
Voted
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 5 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith