2412 search results - page 95 / 483 » Which Problems Have Strongly Exponential Complexity |
134
click to vote
AAAI
2006
15 years 4 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
121
click to vote
IJCAI
1997
15 years 4 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
AUTOMATICA
2008
15 years 3 months ago
2008
We consider the problem of stabilization of a one-dimensional wave equation that contains instability at its free end and control on the opposite end. In contrast to classical col...
102
click to vote
COR
2006
15 years 3 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
115
click to vote
KI
2006
Springer
15 years 3 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...