Sciweavers

1026 search results - page 197 / 206
» On Finding Minimal w-cutset
Sort
View
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 9 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
AIPS
2009
13 years 8 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
ATAL
2010
Springer
13 years 8 months ago
Aggregation-mediated collective perception and action in a group of miniature robots
We introduce a novel case study in which a group of miniaturized robots screen an environment for undesirable agents, and destroy them. Because miniaturized robots are usually end...
Grégory Mermoud, Loïc Matthey, William...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
AEI
2007
91views more  AEI 2007»
13 years 7 months ago
MICF: An effective sanitization algorithm for hiding sensitive patterns on data mining
Data mining mechanisms have widely been applied in various businesses and manufacturing companies across many industry sectors. Sharing data or sharing mined rules has become a tr...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang