Sciweavers

438 search results - page 13 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
MOBICOM
2009
ACM
14 years 1 months ago
Revenue maximization and distributed power allocation in cognitive radio networks
Cognitive radio is an enabling technology that allows unlicensed users to opportunistically access the spectrum in order to enhance the spectrum efficiency. In this paper, we cons...
Shaolei Ren, Mihaela van der Schaar
ATAL
2006
Springer
13 years 11 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 27 days ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
PODC
2003
ACM
14 years 19 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...