Sciweavers

1763 search results - page 214 / 353
» Dependent random choice
Sort
View
POPL
2007
ACM
14 years 8 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
P2P
2007
IEEE
14 years 2 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 1 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...
INFOCOM
2003
IEEE
14 years 1 months ago
Estimation of Congestion Price Using Probabilistic Packet Marking
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Dona...