Sciweavers

895 search results - page 103 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
15 years 3 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
EVOW
2007
Springer
15 years 2 months ago
An Evolutionary Approach to Computer-Aided Orchestration
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
Grégoire Carpentier, Damien Tardieu, G&eacu...
77
Voted
JUCS
2002
179views more  JUCS 2002»
14 years 10 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson
83
Voted
ICCSA
2005
Springer
15 years 4 months ago
A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The prima...
Mahmood R. Minhas, Sadiq M. Sait
CEC
2008
IEEE
15 years 5 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang