Sciweavers

2523 search results - page 69 / 505
» Objective: In Minimum Context
Sort
View
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
15 years 4 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 4 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
ISQED
2003
IEEE
71views Hardware» more  ISQED 2003»
15 years 3 months ago
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering
Scan chain insertion can have large impact on routability, wirelength and timing. We propose a routing-driven and timing-aware methodology for scan insertion with minimum wireleng...
Puneet Gupta, Andrew B. Kahng, Stefanus Mantik
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
15 years 2 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki
DAM
2000
126views more  DAM 2000»
14 years 9 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...