115 search results - page 8 / 23 » On the complexity of real solving bivariate systems |
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
IJCV
2006
13 years 8 months ago
2006
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...
ICS
2009
Tsinghua U.
14 years 3 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...