Sciweavers

518 search results - page 94 / 104
» Beating a Random Assignment
Sort
View
KIVS
2005
Springer
15 years 5 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
ISSTA
2004
ACM
15 years 5 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
PODC
2004
ACM
15 years 5 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
HAPTICS
2003
IEEE
15 years 5 months ago
Validity of Haptic Cues and Its Effect on Priming Visual Spatial Attention
This study investigated cross-modal links in attention between haptics and vision. A visual change-detection task was used as a measure of visual attention. Haptic taps on the bac...
J. Jay Young, Hong Z. Tan, Rob Gray
CP
2003
Springer
15 years 5 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez