Sciweavers

361 search results - page 64 / 73
» Ant Colony Optimization
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 1 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
14 years 1 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
ASP
2001
Springer
14 years 2 months ago
Genes and Ants for Default Logic
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
Pascal Nicolas, Frédéric Saubion, Ig...
ICPP
2005
IEEE
14 years 3 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 4 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher