Sciweavers

697 search results - page 92 / 140
» On the Theory of Average Case Complexity
Sort
View
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
14 years 9 days ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
IPPS
1998
IEEE
14 years 7 days ago
Update Protocols and Iterative Scientific Applications
Software DSMs have been a research topic for over a decade. While good performance has been achieved in some cases, consistent performance has continued to elude researchers. This...
Peter J. Keleher
INFOCOM
1997
IEEE
14 years 5 days ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 4 days ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
DAC
2010
ACM
13 years 12 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler