Sciweavers

1060 search results - page 130 / 212
» Notes on Coding Theory
Sort
View
CASES
2003
ACM
15 years 3 months ago
A control-theoretic approach to dynamic voltage scheduling
The development of energy-conscious embedded and/or mobile systems exposes a trade-off between energy consumption and system performance. Recent microprocessors have incorporated ...
Ankush Varma, Brinda Ganesh, Mainak Sen, Suchismit...
ELPUB
2003
ACM
15 years 3 months ago
The Diversity of Trends, Experiences and Approaches in Electronic Publishing: Evidences of a Paradigm Shift on Communication
Electronic publishing constitutes one of the most exciting themes nowadays, amongst academics, at least, though substantial effects of IT usage for communication purposes in other...
Sely Maria de Souza Costa, Ana Cristina Moreira
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
15 years 2 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 1 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...