2412 search results - page 32 / 483 » Which Problems Have Strongly Exponential Complexity |
102
Voted
CSL
2009
Springer
15 years 4 months ago
2009
Springer
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
120
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
74
Voted
APLAS
2008
ACM
15 years 2 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
100
click to vote
UAI
2000
15 years 2 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
106
click to vote
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...