Sciweavers

1404 search results - page 213 / 281
» Optimization problems in multiple-interval graphs
Sort
View
EUROGP
2007
Springer
164views Optimization» more  EUROGP 2007»
15 years 3 months ago
The Induction of Finite Transducers Using Genetic Programming
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...
Amashini Naidoo, Nelishia Pillay
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 3 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
ASPDAC
2004
ACM
113views Hardware» more  ASPDAC 2004»
15 years 1 months ago
Area-minimal algorithm for LUT-based FPGA technology mapping with duplication-free restriction
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
Chi-Chou Kao, Yen-Tai Lai
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 1 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
AIPS
2008
15 years 2 days ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak