Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit...
Abstract. Motion blending is a popular motion synthesis technique which interpolates similar motion examples according to blending weighs parameterizing high-level characteristics ...