198 search results - page 2 / 40 » Anytime Bounded Rationality |
AAAI
2007
13 years 7 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
AGI
2011
12 years 8 months ago
2011
Abstract. Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here we employ an axiomat...
JAT
2010
13 years 3 months ago
2010
We consider rational moment problems on the real line with their associated orthogonal rational functions. There exists a Nevanlinna type parameterization relating to the problem,...
JAIR
2010
13 years 3 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
SOFTWARE
2002
13 years 4 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...