482 search results - page 13 / 97 » An Empirical Study of Distribution based on Voyager: A Perfo... |
JAR
2000
13 years 7 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
MSWIM
2004
ACM
14 years 28 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
The high cost of locating faults in programs has motivated the development of techniques that assist in fault localization by automating part of the process of searching for fault...
SPAA
2000
ACM
13 years 12 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...