2412 search results - page 364 / 483 » Which Problems Have Strongly Exponential Complexity |
EVOW
2001
Springer
14 years 9 days ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
VLSID
1999
IEEE
14 years 2 days ago
1999
IEEE
Formal approaches to HW and system design have not been generally adopted, because designers often view the modelling concepts in these approaches as unsuitable for their problems...
ASAP
1997
IEEE
14 years 1 days ago
1997
IEEE
Improvements in semiconductor integration density and the resulting problem of having to manage designs of increasing complexity is an old one, but still current. The new challeng...
STACS
1994
Springer
13 years 12 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...