The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to an...
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
Motion planning for humanoids faces several challenging issues: high dimensionality of the configuration space, necessity to address balance constraints in single and double suppo...
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...