Sciweavers

411 search results - page 15 / 83
» A New Approach to the Rectilinear Steiner Tree Problem
Sort
View
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
15 years 1 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
DAC
1993
ACM
15 years 1 months ago
A Negative Reinforcement Method for PGA Routing
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
Forbes D. Lewis, Wang Chia-Chi Pong
86
Voted
COCOON
2008
Springer
14 years 11 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
HIS
2008
14 years 11 months ago
REPMAC: A New Hybrid Approach to Highly Imbalanced Classification Problems
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
Hernán Ahumada, Guillermo L. Grinblat, Luca...
INFOCOM
2005
IEEE
15 years 3 months ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...