409 search results - page 76 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
SIGGRAPH
1992
ACM
13 years 11 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
EMSOFT
2004
Springer
14 years 24 days ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...