26 search results - page 2 / 6 » Resource bounded and anytime approximation of belief functio... |
UAI
1998
13 years 6 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
ATAL
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
SIROCCO
2008
13 years 6 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...