497 search results - page 16 / 100 » Approximating max-min linear programs with local algorithms |
115
click to vote
ISPD
2012
ACM
13 years 5 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...