1492 search results - page 2 / 299 » Testing Properties of Constraint-Graphs |
176
click to vote
PAMI
2011
15 years 3 days ago
2011
—Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, und...
152
click to vote
ECCC
2011
14 years 8 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
118
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
154
click to vote
AI
2003
Springer
15 years 10 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
135
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...