Sciweavers

945 search results - page 122 / 189
» Incremental Branching Programs
Sort
View
CEC
2010
IEEE
13 years 9 months ago
An examination on the modularity of grammars in grammatical evolutionary design
Abstract-- This work furthers the understanding of modularity in grammar-based genetic programming approaches by analyzing how different grammars may be capable of producing the sa...
John Mark Swafford, Michael O'Neill
JUCS
2008
117views more  JUCS 2008»
13 years 7 months ago
Disentangling Denotational Semantics Definitions
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Fabio Tirelo, Roberto da Silva Bigonha, Joã...
ENTCS
2007
139views more  ENTCS 2007»
13 years 7 months ago
A Change-based Approach to Software Evolution
Software evolution research is limited by the amount of information available to researchers: Current version control tools do not store all the information generated by developer...
Romain Robbes, Michele Lanza
ANOR
2005
131views more  ANOR 2005»
13 years 7 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
PLDI
2003
ACM
14 years 1 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...