Sciweavers

5624 search results - page 1 / 1125
» On Conditional Covering Problem
Sort
View
MICS
2010
102views more  MICS 2010»
13 years 28 days ago
On Conditional Covering Problem
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...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
SIAMCO
2008
83views more  SIAMCO 2008»
13 years 2 months ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
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 ...
B. T. Kien, N.-C. Wong, J. C. Yao

Publication
252views
13 years 5 months ago
Context models on sequences of covers
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...
Christos Dimitrakakis
FSTTCS
2007
Springer
13 years 8 months ago
Covering Graphs with Few Complete Bipartite Subgraphs
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...
Herbert Fleischner, Egbert Mujuni, Daniël Pau...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
13 years 8 months ago
The Pipelined Set Cover Problem
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...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...