644 search results - page 56 / 129 » Decomposition Complexity |
111
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
101
Voted
COCO
2010
Springer
15 years 4 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
97
Voted
SIAMJO
2008
15 years 16 days ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
70
Voted
IROS
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper presents a new method for planning motions of multi-arm systems in constrained workspaces, for which state-of-the-art planners behave poorly. The method is based on ...
115
Voted
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...