3049 search results - page 396 / 610 » On the Convergence of Bound Optimization Algorithms |
211
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
156
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In the last few years, long-distance WiFi networks have been used to provide Internet connectivity in rural areas. The strong requirement to support real-time applications in th...
187
Voted
SLS
2009
Springer
15 years 11 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
125
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
157
click to vote
DAC
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we study the area and depth trade-off in LUT based FPGA technology mapping. Starting from a depth-optimal mapping solution, we perform a number of depth relaxation o...