Socio-technical processes have come to the forefront of recent analysis of the open source software development (OSSD) world. Interest in making these processes explicit is mounti...
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
Abstract— This paper proposes a multiple robot control algorithm to approach the problem of patrolling an open or closed line. The algorithm is fully decentralized, i.e., no comm...
Alessandro Marino, Lynne E. Parker, Gianluca Anton...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...