Sciweavers

1614 search results - page 86 / 323
» Polymorphism and Genetic Programming
Sort
View
PPSN
2004
Springer
15 years 3 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 1 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
ENGL
2007
121views more  ENGL 2007»
14 years 9 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
ESOP
2001
Springer
15 years 2 months ago
Entailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
Zhendong Su, Alexander Aiken
POPL
1998
ACM
15 years 2 months ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner