3946 search results - page 146 / 790 » The computational complexity of choice sets |
158
click to vote
HUMAN
2003
Springer
15 years 11 months ago
2003
Springer
Perfect protection against all system threats is considered to be impossible. The problem of monitoring against the threats has been an issue in literature, but its progress has no...
149
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
142
click to vote
AIPS
2006
15 years 8 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
171
click to vote
DCG
2010
15 years 5 months ago
2010
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
191
click to vote
CONIELECOMP
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...