Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...