|
|
|
- Efficient Resource Allocation with Noisy Functions
Arne Andersson and Per Carlsson and Fredrik Ygge
- Compact DFA Representation for Fast Regular Expression Search
Gonzalo Navarro and Mathieu Raffinot
- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory
Architecture
David A. Bader and Ajith K. Illendula and Bernard M.E. Moret
- An Experimental Study of Data Migration Algorithms
Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs,
Anna Karlin, Jared Saia, Ram Swaminathan, John Wilkes
- Experimental Analysis of Algorithms for Bilateral-Contract Clearing
Mechanisms Arising in Deregulated Power Industry
Chris Barrett and Doug Cook and Vance Faber and Gregory Hicks and
Achla Marathe and Madhav Marathe and Aravind Srinivasan and
Yoram J. Sussmann and Heidi Thornquist
- An Adaptable and Extensible Geometry Kernel
Susan Hert and Michael Hoffmann and Lutz Kettner and Sylvain Pion
and Michael Seel
- The max-shift algorithm for approximate string matching
Costas S. Iliopoulos, Laurent Mouchard and Yoan J. Pinzon
- Fractal Matrix Multiplication: a Case Study on Portability of
Cache Performance
Gianfranco Bilardi, Paolo D'Aberto and Alexandru Nicolau
- Exploiting Partial Knowledge of Satisfying Assignments
Kazuo Iwama and Suguru Tamaki
- An Experimental Study of Basic Communication Protocols in Ad-hoc
Mobile Networks
Ioannis Chatzigiannakis and Sotiris Nikoletseas and Nearchos
Paspallis and Paul Spirakis and Christos Zaroliagis
- Experiences with the design and implementation of space-efficient
deques
Jyrki Katajainen and Bjarke Buur Mortensen
- Designing and implementing a general purpose halfedge data structure
Hervé Brönnimann
- Pareto Shortest Paths is Often Feasible in Practice
Matthias Mueller-Hannemann and Karsten Weihe
- Optimised Predecessor Data Structures for Internal Memory
Naila Rahman, Richard Cole, Rajeev Raman
- Improving the efficiency of Branch and Bound Algortihms for the Simple
Plant Location Problem
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
|