Sciweavers

101 search results - page 5 / 21
» Improvement on the Decay of Crossing Numbers
Sort
View
DAC
1995
ACM
13 years 11 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
JGAA
2006
100views more  JGAA 2006»
13 years 7 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
14 years 1 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks
Abstract-- In this paper, we analyze asymptotic delaythroughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spat...
Michele Garetto, Emilio Leonardi
FLAIRS
2004
13 years 9 months ago
A Method Based on RBF-DDA Neural Networks for Improving Novelty Detection in Time Series
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
Adriano L. I. Oliveira, Fernando Buarque de Lima N...