Sciweavers

2989 search results - page 74 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
14 years 1 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
PPSN
2004
Springer
15 years 3 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
EOR
2008
91views more  EOR 2008»
14 years 9 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
JSCIC
2008
129views more  JSCIC 2008»
14 years 9 months ago
Level Set Equations on Surfaces via the Closest Point Method
Abstract Level set methods have been used in a great number of applications in R2 and R3 and it is natural to consider extending some of these methods to problems defined on surfac...
Colin B. Macdonald, Steven J. Ruuth
MOC
2010
14 years 4 months ago
A projection-based error analysis of HDG methods
Abstract. We introduce a new technique for the error analysis of hybridizable discontinuous Galerkin (HDG) methods. The technique relies on the use of a new projection whose design...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Franci...