Sciweavers

4335 search results - page 476 / 867
» Privatizing Constraint Optimization
Sort
View
FOCS
2000
IEEE
15 years 8 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
AAAI
2010
15 years 6 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
SEBD
2003
159views Database» more  SEBD 2003»
15 years 6 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
CCE
2008
15 years 5 months ago
Safe-parking of nonlinear process systems
This work considers the problem of control of nonlinear process systems subject to input constraints and actuator faults. Faults are considered that preclude the possibility of con...
Rahul Gandhi, Prashant Mhaskar
CVIU
2008
180views more  CVIU 2008»
15 years 5 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...