Sciweavers

180 search results - page 25 / 36
» Reversible Computation and Reversible Programming Languages
Sort
View
COCOON
2009
Springer
14 years 2 months ago
Hierarchies and Characterizations of Stateless Multicounter Machines
Abstract. We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the...
Oscar H. Ibarra, Ömer Egecioglu
WCRE
2007
IEEE
14 years 2 months ago
Interprocedural Static Single Assignment Form
In this paper we describe interprocedural static single assignment form (ISSA) with optimizations as implemented in the Bauhaus project. We explain our framework which abstract pr...
Stefan Staiger, Gunther Vogel, Steffen Keul, Eduar...

Publication
195views
12 years 6 months ago
Analog Genetic Encoding for the Evolution of Circuits and Networks
This paper describes a new kind of genetic representation called analog genetic encoding (AGE). The representation is aimed at the evolutionary synthesis and reverse engineering of...
Claudio Mattiussi, Dario Floreano
ICFP
2008
ACM
14 years 8 months ago
Quotient lenses
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C...
GPEM
2011
13 years 2 months ago
Expert-driven genetic algorithms for simulating evaluation functions
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropr...
Omid David-Tabibi, Moshe Koppel, Nathan S. Netanya...