Sciweavers

280 search results - page 29 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 8 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
COMCOM
2007
89views more  COMCOM 2007»
14 years 11 months ago
On-the-fly TCP path selection algorithm in access link load balancing
—Many enterprises install multiple access links for fault tolerance or bandwidth enlargement. Dispatching connections through good links is the ultimate goal in utilizing multipl...
Ying-Dar Lin, Shih-Chiang Tsao, Un-Pio Leong
RECOMB
2007
Springer
16 years 3 days ago
Reconstructing the Topology of Protein Complexes
Abstract. Recent advances in high-throughput experimental techniques have enabled the production of a wealth of protein interaction data, rich in both quantity and variety. While t...
Allister Bernard, David S. Vaughn, Alexander J. Ha...
ALGORITHMICA
2011
14 years 3 months ago
Algorithms for Marketing-Mix Optimization
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
ASPDAC
1995
ACM
103views Hardware» more  ASPDAC 1995»
15 years 3 months ago
A scheduling algorithm for multiport memory minimization in datapath synthesis
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
Hae-Dong Lee, Sun-Young Hwang