Sciweavers

2996 search results - page 162 / 600
» Numberings and Randomness
Sort
View
153
Voted
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
15 years 11 months ago
Modular petri net based modeling, analysis and synthesis of dedicated production systems
−−−− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decompose...
George J. Tsinarakis, Kimon P. Valavanis, Nikos Ts...
123
Voted
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
15 years 5 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 5 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
INFOCOM
2009
IEEE
16 years 7 days ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
ICALP
2004
Springer
15 years 11 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...