2412 search results - page 472 / 483 » Which Problems Have Strongly Exponential Complexity |
114
click to vote
PLDI
2003
ACM
15 years 5 months 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...
121
Voted
SPAA
2003
ACM
15 years 5 months 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...
113
Voted
ADC
2003
Springer
15 years 5 months 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...
130
Voted
KR
2010
Springer
15 years 5 months 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...
129
Voted
DFG
2001
Springer
15 years 5 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...