2412 search results - page 87 / 483 » Which Problems Have Strongly Exponential Complexity |
155
click to vote
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
125
click to vote
AAAI
2010
15 years 4 months ago
2010
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
130
click to vote
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
129
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
141
click to vote
ICSOC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...