Sciweavers

1576 search results - page 310 / 316
» Properties of Synthetic Optimization Problems
Sort
View
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 10 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
PERCOM
2006
ACM
14 years 9 months ago
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
Kenneth A. Berman, Fred S. Annexstein, Aravind Ran...
MOBISYS
2007
ACM
14 years 9 months ago
Improving mobile database access over wide-area networks without degrading consistency
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
Niraj Tolia, Mahadev Satyanarayanan, Adam Wolbach
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 6 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson
INFOCOM
2009
IEEE
14 years 4 months ago
An Economically-Principled Generative Model of AS Graph Connectivity
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, D...