A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
The term scalability appears frequently in computing literature, but it is a term that is poorly defined and poorly understood. The lack of a clear, consistent and systematic trea...
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
— Simulation is frequently used in the study of multi-agent systems. Unfortunately, in many cases, it is not necessarily clear how faithfully the details of the simulated model r...
Christopher M. Cianci, Jim Pugh, Alcherio Martinol...