Sciweavers

2523 search results - page 278 / 505
» Objective: In Minimum Context
Sort
View
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
16 years 17 days ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
16 years 6 days ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang
INFOCOM
2005
IEEE
16 years 5 days ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
VLSID
2005
IEEE
120views VLSI» more  VLSID 2005»
16 years 5 days ago
On Finding Consecutive Test Vectors in a Random Sequence for Energy-Aware BIST Design
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattachar...
WACV
2005
IEEE
16 years 5 days ago
Automatic Augmentation and Meshing of Sparse 3D Scene Structure
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
Oli Cooper, Neill W. Campbell, David P. Gibson