Sciweavers

113 search results - page 3 / 23
» Trunk decomposition based global routing optimization
Sort
View
INFOCOM
2012
IEEE
12 years 7 days ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
ICCD
2008
IEEE
124views Hardware» more  ICCD 2008»
14 years 6 months ago
Global bus route optimization with application to microarchitectural design exploration
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
Dae Hyun Kim, Sung Kyu Lim
DAC
2000
ACM
14 years 10 months ago
An architecture-driven metric for simultaneous placement and global routing for FPGAs
FPGA routing resources typically consist of segments of various lengths. Due to the segmented routing architectures, the traditional measure of wiring cost (wirelength, delay, con...
Yao-Wen Chang, Yu-Tsang Chang
3DIM
2005
IEEE
14 years 3 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
CN
2010
103views more  CN 2010»
13 years 10 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...