Sciweavers

6693 search results - page 149 / 1339
» On an anytime algorithm for control
Sort
View
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
15 years 4 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....
CEC
2007
IEEE
15 years 4 months ago
Self-adaptation of mutation distribution in evolutionary algorithms
— This paper proposes a self-adaptation method to control not only the mutation strength parameter, but also the mutation distribution for evolutionary algorithms. For this purpo...
Renato Tinós, Shengxiang Yang
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 1 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
Terry P. Riopka, Peter Bock
ACL
1997
14 years 11 months ago
An Algorithm for Generating Referential Descriptions with Flexible Interfaces
Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing compon...
Helmut Horacek
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 7 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...