Sciweavers

2190 search results - page 260 / 438
» An optimal algorithm to generate tilings
Sort
View
CGF
2000
96views more  CGF 2000»
15 years 6 months ago
An interactive approach to point cloud triangulation
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
Leif Kobbelt, Mario Botsch
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 12 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 5 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
JMLR
2010
148views more  JMLR 2010»
15 years 1 months 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
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
16 years 5 days ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...