Sciweavers

2412 search results - page 93 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
IJCAI
1993
15 years 4 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
ESOP
2001
Springer
15 years 7 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
COCOON
2009
Springer
15 years 9 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
NN
2006
Springer
127views Neural Networks» more  NN 2006»
15 years 3 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai
AAAI
1994
15 years 4 months ago
Tractable Planning with State Variables by Exploiting Structural Restrictions
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
Peter Jonsson, Christer Bäckström