Sciweavers

1612 search results - page 191 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
DAC
2004
ACM
15 years 6 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv
183
Voted
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 2 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
135
Voted
MST
2010
98views more  MST 2010»
15 years 28 days ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
81
Voted
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 8 months ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton
LCN
2000
IEEE
15 years 6 months ago
Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cob...