2957 search results - page 29 / 592 » The Complexity of Polynomial-Time Approximation |
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
WG
2001
Springer
13 years 12 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
WADS
2001
Springer
14 years 3 min ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...