The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
Volkan Akcelik, George Biros, Andrei Draganescu, J...
In this paper we present a nonlinear programming solution to one of the most challenging problems in trajectory optimization. Unlike most aerospace trajectory optimization problems...
H. M. Prasanna, D. Ghose, M. S. Bhat, Chiranjib Bh...