519 search results - page 25 / 104 » A New Approach to Strongly Polynomial Linear Programming |
117
click to vote
CGF
2008
15 years 1 months ago
2008
In this paper we propose a new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary. The basic idea stems from an interp...
111
click to vote
ATAL
2006
Springer
15 years 5 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...
113
click to vote
AIPS
2007
15 years 3 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
ECCC
2007
15 years 1 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...