Sciweavers

337 search results - page 9 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
AAAI
2006
13 years 9 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
TWC
2008
150views more  TWC 2008»
13 years 7 months ago
Convex approximation techniques for joint multiuser downlink beamforming and admission control
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
Evaggelia Matskani, Nicholas D. Sidiropoulos, Zhi-...
ICASSP
2009
IEEE
14 years 2 months ago
Ranging energy optimization for robust sensor positioning
We address ranging energy optimization for an unsynchronized localization system, which features robust sensor positioning, in the sense that specific accuracy requirements are f...
Tao Wang, Geert Leus, Dries Neirynck, Feng Shu, Li...
CADE
2009
Springer
14 years 8 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
FCT
2007
Springer
14 years 1 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...