Sciweavers

352 search results - page 46 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
DAC
2000
ACM
14 years 10 months ago
Can recursive bisection alone produce routable placements?
This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the stateof-the-art after two decades of research in recursive ...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
ICPP
2000
IEEE
14 years 1 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
ANSS
2006
IEEE
14 years 3 months ago
Grid-Boxing for Spatial Simulation Performance Optimisation
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
Kenneth A. Hawick, Heath A. James, C. J. Scogings
ICSM
2005
IEEE
14 years 2 months ago
Comparison of Clustering Algorithms in the Context of Software Evolution
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
Jingwei Wu, Ahmed E. Hassan, Richard C. Holt