Sciweavers

23 search results - page 2 / 5
» On the Hardness of Optimization in Power Law Graphs
Sort
View
ICAC
2006
IEEE
13 years 10 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
CPAIOR
2010
Springer
13 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
VLSID
2002
IEEE
149views VLSI» more  VLSID 2002»
14 years 4 months ago
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-Chip
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
Yunsi Fei, Niraj K. Jha
VLSID
2002
IEEE
151views VLSI» more  VLSID 2002»
14 years 4 months ago
Mode Selection and Mode-Dependency Modeling for Power-Aware Embedded Systems
Among the many techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model at the same time. S...
Dexin Li, Pai H. Chou, Nader Bagherzadeh
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 4 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...