Sciweavers

5387 search results - page 576 / 1078
» Generating generic functions
Sort
View
ITICSE
2000
ACM
15 years 11 months ago
The ANIMAL algorithm animation tool
In this paper, we present ANIMAL, a new tool for developing animations to be used in lectures. ANIMAL offers a small but powerful set of graphical operators. Animations are genera...
Guido Rößling, Markus Schüer, Bern...
164
Voted
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
15 years 11 months ago
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Teru...
LICS
1999
IEEE
15 years 11 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
EPS
1997
Springer
15 years 11 months ago
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms
Abstract. In Neo-Darwinism, mutation can be considered to be unaffected by selection pressure. This is the metaphor generally used by the genetic algorithm for its treatment of the...
Stephen A. Stanhope, Jason M. Daida
IFL
1997
Springer
158views Formal Methods» more  IFL 1997»
15 years 11 months ago
A Compacting Garbage Collector for Unidirectional Heaps
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged...
Kent Boortz, Dan Sahlin