Failure Analysis in Backtrack Search for Constraint Satisfaction | Zendy

Tudor Hulubei | Zendy; Barry O’Sullivan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Failure Analysis in Backtrack Search for Constraint Satisfaction

Author(s) -

Tudor Hulubei,

Barry O’Sullivan

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-46267-8

DOI - 10.1007/11889205_60

Subject(s) - computer science , constraint satisfaction problem , constraint (computer aided design) , focus (optics) , constraint satisfaction , search tree , search algorithm , tree (set theory) , theoretical computer science , mathematical optimization , algorithm , artificial intelligence , mathematics , combinatorics , probabilistic logic , optics , physics , geometry

Search effort is typically measured in terms of the number of backtracks, constraint checks, or nodes in the search tree, but measures such as the number of incorrect decisions have also been proposed. Comparisons based on mean and median effort are common. However, other researchers focus on studying runtime distributions, where one can observe a (non-)heavy-tailed distribution under certain conditions [2, 3].

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research