Sciweavers

449 search results - page 23 / 90
» Evolutionary Approaches to Linear Ordering Problem
Sort
View
HAIS
2009
Springer
13 years 10 months ago
A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection
Abstract. Cooperative Coevolution is a technique in the area of Evolutionary Computation. It has been applied to many combinatorial problems with great success. This contribution p...
Joaquín Derrac, Salvador García, Fra...
ECAL
1995
Springer
13 years 11 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph
CVPR
2010
IEEE
14 years 3 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
CEC
2010
IEEE
13 years 8 months ago
Providing a memory mechanism to enhance the evolutionary design of heuristics
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...
Edmund K. Burke, Matthew R. Hyde, Graham Kendall
AAAI
2006
13 years 8 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith