Sciweavers

32 search results - page 5 / 7
» Belief Merging-Based Case Combination
Sort
View
AAAI
2006
13 years 9 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
BIRTHDAY
2005
Springer
14 years 1 months ago
Objective Bayesian Nets
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
Jon Williamson
MATA
2004
Springer
101views Communications» more  MATA 2004»
14 years 1 months ago
Mobile Tourist Guide Services with Software Agents
Applications for mobile devices have some restrictions because of the limited capabilities and heterogeneity of these devices. However, their communication capabilities allow the d...
Juan Pavón, Juan M. Corchado, Jorge J. G&oa...
ICCV
2009
IEEE
13 years 5 months ago
Dense 3D reconstruction method using a single pattern for fast moving object
Dense 3D reconstruction of extremely fast moving objects could contribute to various applications such as body structure analysis and accident avoidance and so on. The actual case...
Ryusuke Sagawa, Yuichi Ota, Yasushi Yagi, Ryo Furu...
KR
1989
Springer
13 years 11 months ago
Impediments to Universal Preference-Based Default Theories
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
Jon Doyle, Michael P. Wellman