Sciweavers

RTA
2011
Springer
12 years 7 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
DCC
1993
IEEE
13 years 8 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
GECCO
2003
Springer
13 years 9 months ago
Visualizing Tree Structures in Genetic Programming
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees of arbitrary ...
Jason M. Daida, Adam M. Hilss, David J. Ward, Step...
ECAL
2003
Springer
13 years 9 months ago
Evolving Developmental Programs for Adaptation, Morphogenesis, and Self-Repair
A method for evolving a developmental program inside a cell to create multicellular organisms of arbitrary size and characteristics is described. The cell genotype is evolved so th...
Julian F. Miller