Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
Paul Barford, Nick G. Duffield, Amos Ron, Joel Som...
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...