Sciweavers

113 search results - page 17 / 23
» Trunk decomposition based global routing optimization
Sort
View
ANSS
2006
IEEE
15 years 3 months ago
Swarm-based Active Tunable Routing for Overhead Reduction in Multiservice Networks
The explosive growth of multimedia and other bandwidth intensive applications has resulted a rapid increase in the size of the traffic loads that needs to be supported by modern n...
Constandinos X. Mavromoustakis, Helen D. Karatza
DAM
2008
111views more  DAM 2008»
14 years 9 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
DAC
2007
ACM
15 years 10 months ago
MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs
In this paper, we present a new multi-packing tree (MP-tree) representation for macro placement to handle mixed-size designs. Based on binary trees, the MP-tree is very efficient,...
Tung-Chieh Chen, Ping-Hung Yuh, Yao-Wen Chang, Fwu...
ISLPED
2005
ACM
103views Hardware» more  ISLPED 2005»
15 years 3 months ago
A technique for low energy mapping and routing in network-on-chip architectures
Network-on-chip (NoC) has been proposed as a solution for the global communication challenges of System-on-chip (SoC) design in the nanoscale technologies. NoC design with mesh ba...
Krishnan Srinivasan, Karam S. Chatha
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 3 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...