ACM DL

Experimental Algorithmics (JEA)

Menu

Search Issue
enter search term and/or author name

Archive


Journal of Experimental Algorithmics (JEA), Volume 2, 1997

Algorithmic aspects in speech recognition: an introduction
Adam L. Buchsbaum, Raffaele Giancarlo
Article No.: 1
DOI: 10.1145/264216.264219
Speech recognition is an area with a considerable literature, but there is little discussion of the topic within the computer science algorithms literature. Many computer scientists, however, are interested in the computational problems of...

Reactive search, a history-sensitive heuristic for MAX-SAT
Roberto Battiti, Marco Protasi
Article No.: 2
DOI: 10.1145/264216.264220
The Reactive Search (RS) method proposes the integration of a simple history-sensitive (machine learning) scheme into local search for the on-line determination of free parameters. In this paper a new RS algorithm is proposed...

The exponential hash function
Bradley J. Smith, Gregory L. Heileman, Chaouki Abdallah
Article No.: 3
DOI: 10.1145/264216.264221
In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the...

An experimental study of the basis for graph drawing algorithms
H. C. Purchase, R. F. Cohen, M. I. James
Article No.: 4
DOI: 10.1145/264216.264222
Designers of graph drawing algorithms and systems claim to illuminate application data by producing layouts that optimise measurable aesthetic qualities. Examples of these aesthetics include symmetry (where possible, a...

An empirical study of dynamic graph algorithms
David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
Article No.: 5
DOI: 10.1145/264216.264223
The contributions of this paper are both of theoretical and of experimental nature. From the experimental point of view, we conduct an empirical study on some dynamic connectivity algorithms which where developed recently. In particular, the...