1772 search results - page 85 / 355 » Classifying Problems into Complexity Classes |
124
click to vote
AIPS
2007
15 years 4 months 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...
DAM
2006
15 years 2 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
112
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
132
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
117
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...