Sciweavers

216 search results - page 33 / 44
» Covering Problems with Hard Capacities
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
KBSE
2007
IEEE
14 years 1 months ago
Direct-dependency-based software compatibility testing
Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
MOBICOM
2005
ACM
14 years 1 months ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora
RTAS
2009
IEEE
14 years 2 months ago
Lightweight Modeling of Complex State Dependencies in Stream Processing Systems
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
Anne Bouillard, Linh T. X. Phan, Samarjit Chakrabo...
COMGEO
2012
ACM
12 years 3 months ago
Routing multi-class traffic flows in the plane
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...