Sciweavers

6010 search results - page 438 / 1202
» Computational Approaches to Drug Design
Sort
View
DAC
2007
ACM
16 years 8 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
16 years 1 months ago
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Claudio Mirolo, Stefano Carpin, Enrico Pagello
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
16 years 9 days ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
PDCN
2004
15 years 8 months ago
A tunable collective communication framework on a cluster of SMPS
In this paper we investigate a tunable MPI collective communications library on a cluster of SMPs. Most tunable collective communications libraries select optimal algorithms for i...
Meng-Shiou Wu, Ricky A. Kendall, Srinivas Aluru
DAC
2000
ACM
16 years 8 months ago
Fast methods for extraction and sparsification of substrate coupling
The sudden increase in systems-on-a-chip designs has renewed interest in techniques for analyzing and eliminating substrate coupling problems. Previous work on the substrate coupl...
Joe Kanapka, Joel R. Phillips, Jacob White