Sciweavers

2168 search results - page 260 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
121
Voted
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 2 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
167
Voted
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 2 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
147
Voted
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
15 years 2 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
WWW
2005
ACM
16 years 4 months ago
The volume and evolution of web page templates
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
David Gibson, Kunal Punera, Andrew Tomkins
132
Voted
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 3 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler