555 search results - page 64 / 111 » Decompositions of Grammar Constraints |
112
Voted
JDA
2010
14 years 7 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
104
Voted
CONSTRAINTS
2010
15 years 25 days ago
2010
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
116
click to vote
CAV
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
131
click to vote
AAAI
1994
15 years 2 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
112
Voted
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...