2084 search results - page 48 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
TPDS
1998
14 years 9 months ago
1998
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
RTAS
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...