Assignment precipitation in fail first search
No Thumbnail Available
File version
Author(s)
Namazi, M
Ghooshchi, NG
Hakim Newton, MA
Sattar, A
Ghooshchi, NG
Hakim Newton, MA
Sattar, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location
License
Abstract
Within a fail first search, we relocate assignments towards the bottom of the upward-growing assignment stack. We do that when the related variables, due to search dynamics, become more constrained than were anticipated before. This fixes early variable selection mistakes.
Journal Title
Lecture Notes in Computer Science
Conference Title
Book Title
Edition
Volume
9992
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Other information and computing sciences not elsewhere classified