232 search results - page 39 / 47 » Completeness and Decidability in Sequence Logic |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
CPC
2007
13 years 7 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
MFCS
2010
Springer
13 years 5 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...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...