Zhu, Zichen.Thesis Ph.D. Chinese University of Hong Kong 2016.Includes bibliographical references (leaves ).Abstracts also in Chinese.Title from PDF title page (viewed on …)
Constraint satisfaction and optimisation problems occur frequently in industry and are usually compu...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
The date of receipt and acceptance will be inserted by the editor Abstract We reconsider the idea of...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The Chinese University of Hong Kong holds the copyright of this thesis. Any person(s) intending to u...
Abstract. Symmetry in Constraint Satisfaction Problems (CSPs) can lead to redundant search, since su...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
This chapter discusses symmetry in constraint satisfaction problems. It is part of a collection whic...
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (...
In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted con...
The paper proposes a dynamic method, Recursive SBDS(ReSBDS), for efficient partial symmetry breaking...
We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a ...
Symmetries in constraint problems present an opportunity for reducing search. This paper presents L...
1. Introduction Many real life problems can be modeled as constraint satisfaction prob-lems (CSPs), ...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Constraint satisfaction and optimisation problems occur frequently in industry and are usually compu...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
The date of receipt and acceptance will be inserted by the editor Abstract We reconsider the idea of...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The Chinese University of Hong Kong holds the copyright of this thesis. Any person(s) intending to u...
Abstract. Symmetry in Constraint Satisfaction Problems (CSPs) can lead to redundant search, since su...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
This chapter discusses symmetry in constraint satisfaction problems. It is part of a collection whic...
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (...
In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted con...
The paper proposes a dynamic method, Recursive SBDS(ReSBDS), for efficient partial symmetry breaking...
We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a ...
Symmetries in constraint problems present an opportunity for reducing search. This paper presents L...
1. Introduction Many real life problems can be modeled as constraint satisfaction prob-lems (CSPs), ...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Constraint satisfaction and optimisation problems occur frequently in industry and are usually compu...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
The date of receipt and acceptance will be inserted by the editor Abstract We reconsider the idea of...