We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
One of the main question addressed by paleoanthropologists is the recovery of plausible motions for extinct species whose knowledge is generally limited to incomplete bones and ske...
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
The paper presents a sketch of a framework-based agile reengineering process, named PARFAIT1 , whose objective is to provide the users with evolved versions of legacy systems, as ...
—Pedestrian detection is a key problem in computer vision, with several applications that have the potential to positively impact quality of life. In recent years, the number of ...