Sciweavers

6251 search results - page 1027 / 1251
» Randomness, Computability, and Density
Sort
View
149
Voted
ISSTA
2006
ACM
15 years 10 months ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...
154
Voted
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 10 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 10 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
« Prev « First page 1027 / 1251 Last » Next »