395 search results - page 20 / 79 » Positive Versions of Polynomial Time |
SODA
2012
ACM
13 years 7 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
AAAI
2004
14 years 11 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
AI
2007
Springer
14 years 10 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
AMC
2010
14 years 10 months ago
2010
The extension of the Leitmann-Schmitendorf advertising game to n players and positive time discounting is investigated. We show that the strong time consistency of the open-loop N...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...