Sciweavers

932 search results - page 163 / 187
» Uniform Random Number Generators
Sort
View
ICWS
2004
IEEE
14 years 11 months ago
Large Scale, Type-Compatible Service Composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
WSC
2001
14 years 11 months ago
Study of an ergodicity pitfall in multitrajectory simulation
Multitrajectory Simulation allows random events in a simulation to generate multiple trajectories. Management techniques have been developed to manage the choices of trajectories ...
John B. Gilmer Jr., Frederick J. Sullivan
WSC
2004
14 years 11 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
CORR
2008
Springer
123views Education» more  CORR 2008»
14 years 9 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
ECCC
2010
73views more  ECCC 2010»
14 years 9 months ago
Matching Vector Codes
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin