Sciweavers

52 search results - page 8 / 11
» Primal-Dual Approximation Algorithms for Feedback Problems
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
TACAS
2010
Springer
162views Algorithms» more  TACAS 2010»
14 years 2 months ago
Computing the Leakage of Information-Hiding Systems
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
13 years 6 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
ICASSP
2008
IEEE
14 years 2 months ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 1 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...