115 search results - page 16 / 23 » The Computational Complexity of Monotonicity in Probabilisti... |
VOSS
2004
Springer
14 years 1 days ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
IPPS
2006
IEEE
14 years 22 days ago
2006
IEEE
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
SIGMETRICS
2006
ACM
14 years 20 days ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...