Sciweavers

4488 search results - page 745 / 898
» Properties of NP-Complete Sets
Sort
View
JAIR
2000
152views more  JAIR 2000»
13 years 9 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
FMSD
2002
81views more  FMSD 2002»
13 years 9 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 9 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
IJCV
2002
157views more  IJCV 2002»
13 years 9 months ago
Hamilton-Jacobi Skeletons
In an effort to articulate models for the intuitive representation and manipulation of 2D and 3D forms, Blum (1967, 1973) invented the notion of a skeleton. His insight was to con...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
CPC
1998
91views more  CPC 1998»
13 years 9 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický