Sciweavers

595 search results - page 52 / 119
» A Constraint Programming Approach for Solving a Queueing Con...
Sort
View
SIAMSC
2010
116views more  SIAMSC 2010»
13 years 7 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
PLDI
2010
ACM
14 years 6 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
ICMCS
2006
IEEE
167views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Efficient Object Tracking using Control-Based Observer Design
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
Wei Qu, Dan Schonfeld
GLOBECOM
2008
IEEE
14 years 3 months ago
Outage-Based Rate Maximization in CDMA Wireless Networks
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
M. D'Angelo, Carlo Fischione, Matteo Butussi, Ales...
CDC
2010
IEEE
13 years 3 months ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh