1431 search results - page 47 / 287 » The complexity of random ordered structures |
COCO
2009
Springer
15 years 1 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
ESA
2003
Springer
15 years 2 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
PODC
2010
ACM
14 years 8 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...