Sciweavers

1429 search results - page 116 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 15 days ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 12 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
NIPS
2004
13 years 10 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
13 years 9 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
WSC
2007
13 years 11 months ago
Path-sampling for state-dependent importance sampling
State-dependent importance sampling (SDIS) has proved to be particularly useful in simulation (specially in rare event analysis of stochastic systems). One approach for designing ...
Jose H. Blanchet, Jingchen Liu