168 search results - page 22 / 34 » An Upper Bound for B2[2] Sequences |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
AAAI
1992
13 years 9 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
TIT
1998
13 years 7 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
CCCG
2010
13 years 9 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...