967 search results - page 188 / 194 » Probabilistic Predicative Programming |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....