Sciweavers

6943 search results - page 763 / 1389
» Representations for evolutionary algorithms
Sort
View
CP
2005
Springer
16 years 23 days ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CPAIOR
2005
Springer
16 years 23 days ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 19 days ago
Central Point Crossover for Neuro-genetic Hybrids
In this paper, we consider each neural network as a point in a multi-dimensional problem space and suggest a crossover that locates the central point of a number of neural networks...
Soonchul Jung, Byung Ro Moon
RISE
2004
Springer
16 years 18 days ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
WABI
2004
Springer
16 years 18 days ago
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reco...
Anne Bergeron, Mathieu Blanchette, Annie Chateau, ...