Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Parvin Sadigova"'
Publikováno v:
LPAR
King's College London
King's College London
The lookahead approach for binary-tree-based search in constraint solving favors branching that provide the lowest upper bound for the remaining search space. The approach has recently been applied in instance partitioning in divide-and-conquer-based