Sciweavers

1806 search results - page 321 / 362
» Randomness and halting probabilities
Sort
View
PARELEC
2006
IEEE
15 years 5 months ago
MPI and Non-MPI Simulations for Epitaxial Surface Growth
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
Carmen B. Navarrete, Susana Holgado, Eloy Anguiano
IMC
2006
ACM
15 years 5 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
INFOCOM
2005
IEEE
15 years 5 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 5 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 5 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