Sciweavers

683 search results - page 17 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
ICPP
2005
IEEE
14 years 1 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
ICALP
1999
Springer
14 years 1 days ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
KBSE
1998
IEEE
14 years 12 hour ago
An Automated Framework for Structural Test-Data Generation
Structural testing criteria are mandated in many software development standards and guidelines. The process of generating test-data to achieve 100 coverage of a given structural c...
Nigel Tracey, John A. Clark, Keith Mander, John A....
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
EDBT
2000
ACM
14 years 3 days ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel