106 search results - page 13 / 22 » Exponential Time Complexity of the Permanent and the Tutte P... |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
TAPSOFT
1991
Springer
15 years 1 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
AIPS
2007
15 years 11 hour ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...