Sciweavers

3875 search results - page 529 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
NIPS
2007
15 years 8 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
16 years 1 months ago
Oracular Partially Observable Markov Decision Processes: A Very Special Case
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
Nicholas Armstrong-Crews, Manuela M. Veloso
INFOCOM
2010
IEEE
15 years 5 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
TACAS
2010
Springer
162views Algorithms» more  TACAS 2010»
16 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...
INFOCOM
2008
IEEE
16 years 1 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves