2412 search results - page 472 / 483 » Which Problems Have Strongly Exponential Complexity |
PLDI
2003
ACM
14 years 22 days ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
SPAA
2003
ACM
14 years 22 days ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
ADC
2003
Springer
14 years 21 days ago
2003
Springer
Database modeling is still a job of an artisan. Due to this approach database schemata evolve by growth without any evolution plan. Finally, they cannot be examined, surveyed, con...
KR
2010
Springer
14 years 8 days ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
DFG
2001
Springer
13 years 12 months ago
2001
Springer
: Using stereo-3D hardware in its different solutions is not new, but most available applications use these Hardware only for a better visualization of 3d-reconstructions. It is an...