Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
An adaptive control scheme for mechanical manipulators is proposed. The control loop essentially consists of a network for learning the robot's inverse dynamics and on-line ge...
—We propose a virtualization framework to separate the network operator (NO) who focuses on wireless resource management and service providers (SP) who target distinct objectives...
Some aspects of goal-oriented a posteriori error estimation are addressed in the context of steady convection-diffusion equations. The difference between the exact and approxima...