854 search results - page 81 / 171 » Abstracting from Failure Probabilities |
125
click to vote
IBPRIA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
124
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
123
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
117
click to vote
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
164
click to vote
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...