6110 search results - page 172 / 1222 » Approximate Computing |
152
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
184
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
188
click to vote
UAI
2001
15 years 7 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
287
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
180
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...