: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...
This paper presents a software system that is able to generate crosswords with no human intervention including definition generation and crossword compilation. In particular, the ...
Leonardo Rigutini, Michelangelo Diligenti, Marco M...
This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the mod...
Oliver Matias van Kaick, Murilo Vicente Gonç...
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...