13376 search results - page 190 / 2676 » Problem Solving with |
125
Voted
ATAL
2006
Springer
15 years 7 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...
123
click to vote
JSCIC
2006
15 years 3 months ago
2006
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...
124
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
114
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
126
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...