— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...