We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
— A considerable amount of research has been done on the use of logarithmic quantizers for networked feedback control systems. However, most results are developed for the case of...
Daniel Ferreira Coutinho, Minyue Fu, Carlos E. de ...
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...