Sciweavers

79
Voted
DAGSTUHL
2000
14 years 10 months ago
On the Competitive Complexity of Navigation Tasks
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
DAGSTUHL
2000
14 years 10 months ago
Vision for Interaction
Henrik I. Christensen, Danica Kragic, F. Sandberg
53
Voted
DAGSTUHL
2000
14 years 10 months ago
Workload Characterization Issues and Methodologies
Maria Calzarossa, Luisa Massari, Daniele Tessera
54
Voted
DAGSTUHL
2000
14 years 10 months ago
Approximation of 3D Shortest Polygons in Simple Cube Curves
Thomas Bülow, Reinhard Klette
87
Voted
DAGSTUHL
2000
14 years 10 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
70
Voted
DAGSTUHL
2000
14 years 10 months ago
Algorithm Engineering for Parallel Computation
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used ...
David A. Bader, Bernard M. E. Moret, Peter Sanders