10988 search results - page 470 / 2198 » Algorithmic Folding Complexity |
149
Voted
SODA
2010
ACM
16 years 3 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
195
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
210
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
161
click to vote
CGO
2005
IEEE
16 years 1 days ago
2005
IEEE
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
185
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...