1263 search results - page 108 / 253 » A* with Bounded Costs |
149
click to vote
INFOCOM
2007
IEEE
16 years 18 days ago
2007
IEEE
Abstract—It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. ...
178
click to vote
SSDBM
2007
IEEE
16 years 17 days ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
174
click to vote
FMCAD
2007
Springer
16 years 14 days ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
152
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
186
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...