Sciweavers

7103 search results - page 426 / 1421
» Program Generation and Components
Sort
View
COLING
2002
15 years 4 months ago
A Linguistic Discovery Program that Verbalizes its Discoveries
We describe a discovery program, called UNIVAUTO (UNIVersals AUthoringTOol), whose domain of application is the study of language universals, a classic trend in contemporary lingu...
Vladimir Pericliev
EC
1998
134views ECommerce» more  EC 1998»
15 years 4 months ago
Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, s...
Riccardo Poli, William B. Langdon
IOR
2010
86views more  IOR 2010»
15 years 2 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 2 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
EUROGP
2003
Springer
259views Optimization» more  EUROGP 2003»
15 years 9 months ago
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...