The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
We present a class of models that, via a simple construction,
enables exact, incremental, non-parametric, polynomial-time,
Bayesian inference of conditional measures. The approac...
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...