534 search results - page 40 / 107 » Efficient polynomial L-approximations |
FAW
2010
Springer
13 years 8 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— The ability of mobile robots to quickly and accurately analyze their dynamics is critical to their safety and efficient operation. In field conditions, significant uncertainty ...
ASPDAC
2004
ACM
13 years 11 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...