Sciweavers

CPAIOR
2004
Springer
13 years 9 months ago
O(n log n) Filtering Algorithms for Unary Resource Constraint
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
Petr Vilím
CPAIOR
2005
Springer
13 years 9 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím