Sciweavers

4903 search results - page 60 / 981
» The Set Covering Machine
Sort
View
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 1 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
FOCS
2000
IEEE
14 years 19 days ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
COLT
1993
Springer
14 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
DLT
2008
13 years 10 months ago
Universal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
Cristian S. Calude, André Nies, Ludwig Stai...
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
14 years 2 months ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl