496 search results - page 8 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
IPL
2000
13 years 7 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
IJCGA
2006
13 years 7 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
FCT
2003
Springer
14 years 25 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...