4103 search results - page 681 / 821 » Some results on the Collatz problem |
170
click to vote
IJCAI
2003
15 years 7 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
159
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
260
click to vote
VIIP
2001
15 years 7 months ago
2001
Surface reconstruction problem (SRP) from planar samples has been traditionally approached by either (i) using local proximity between data points in adjacent layers, or by (ii) c...
134
click to vote
NIPS
2003
15 years 7 months ago
2003
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
198
click to vote
PUK
2003
15 years 7 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...