2563 search results - page 213 / 513 » Phenomenology, Representations and Complexity |
194
click to vote
IJAR
2008
15 years 7 months ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
157
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
204
click to vote
DAM
2007
15 years 7 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
176
click to vote
JAIR
2007
15 years 7 months ago
2007
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
187
click to vote
IR
2000
15 years 7 months ago
2000
In this paper we look at some of the problems in interacting with best-match retrieval systems. In particular, we examine the areas of interaction, some investigations of the compl...