Sciweavers

4131 search results - page 12 / 827
» Compactness in Topology and Computation
Sort
View
AAAI
1996
15 years 3 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
84
Voted
DNA
2004
Springer
152views Bioinformatics» more  DNA 2004»
15 years 7 months ago
Compact Error-Resilient Computational DNA Tiling Assemblies
John H. Reif, Sudheer Sahu, Peng Yin
JSCIC
2008
48views more  JSCIC 2008»
15 years 1 months ago
A Level-Set Method for Computing the Eigenvalues of Elliptic Operators Defined on Compact Hypersurfaces
We demonstrate, through separation of variables and estimates from the semiclassical analysis of the Schr
Jeremy Brandman
119
Voted
GIS
2008
ACM
15 years 2 months ago
Sparse terrain pyramids
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider sparse...
Kenneth Weiss, Leila De Floriani
CCA
2005
Springer
15 years 7 months ago
The Dedekind Reals in Abstract Stone Duality
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
Andrej Bauer, Paul Taylor 0002