Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...