713 search results - page 85 / 143 » Saving Space by Algebraization |
111
Voted
CONCUR
2001
Springer
15 years 5 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
90
Voted
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
96
Voted
AIPS
2008
15 years 2 months ago
2008
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
AIPS
2008
15 years 2 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
113
Voted
JSYML
2010
14 years 7 months ago
2010
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...