Sciweavers

1662 search results - page 277 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIGCOMM
2010
ACM
13 years 9 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
14 years 9 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
SDM
2009
SIAM
204views Data Mining» more  SDM 2009»
14 years 5 months ago
Application of Bayesian Partition Models in Warranty Data Analysis.
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
Axel Blumenstock, Christoph Schlieder, Markus M&uu...
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
14 years 3 months ago
Hardware/software co-design architecture for thermal management of chip multiprocessors
—The sustained push for performance, transistor count, and instruction level parallelism has reached a point where chip level power density issues are at the forefront of design ...
Omer Khan, Sandip Kundu
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 1 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak