248 search results - page 9 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper studies system identification of ARMA models whose outputs are subject to finite-level quantization and random packet dropouts. A simple adaptive quantizer and the co...