Sciweavers

2323 search results - page 183 / 465
» Power optimization for connectivity problems
Sort
View
GD
2007
Springer
15 years 10 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
15 years 9 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
ICCAD
1997
IEEE
75views Hardware» more  ICCAD 1997»
15 years 8 months ago
An exact gate decomposition algorithm for low-power technology mapping
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
Hai Zhou, D. F. Wong
ICPR
2008
IEEE
16 years 5 months ago
Unsupervised design of Artificial Neural Networks via multi-dimensional Particle Swarm Optimization
In this paper, we present a novel and efficient approach for automatic design of Artificial Neural Networks (ANNs) by evolving to the optimal network configuration(s) within an ar...
E. Alper Yildirim, Ince Turker, Moncef Gabbouj, Se...
ICOIN
2005
Springer
15 years 10 months ago
S-RO: Simple Route Optimization Scheme with NEMO Transparency
Network mobility (NEMO) basic support protocol maintains the connectivity when mobile router (MR) changes its point of attachment to the Internet by establishing a bidirectional tu...
Hanlim Kim, Geunhyung Kim, Cheeha Kim