680 search results - page 39 / 136 » Optimal spot-checking to minimize the computation time in vo... |
BMVC
2001
15 years 4 days ago
2001
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
COR
2007
14 years 9 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
ISLPED
1996
ACM
15 years 1 months ago
1996
ACM
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
108
click to vote
TJS
2002
14 years 9 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...