Sciweavers

71 search results - page 14 / 15
» Probabilistic dynamic belief revision
Sort
View
JUCS
2010
142views more  JUCS 2010»
13 years 5 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
AI
1999
Springer
13 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
AO
2007
144views more  AO 2007»
13 years 7 months ago
Social acquisition of ontologies from communication processes
This work introduces a formal framework for the social acquisition of ontologies which are constructed dynamically from overhearing the possibly conflicting symbolic interaction o...
Matthias Nickles
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
IJCAI
1997
13 years 8 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter