Sciweavers

1712 search results - page 150 / 343
» A Computational Approach to Binding Theory
Sort
View
IJCAI
1989
15 years 2 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
URBAN
2008
128views more  URBAN 2008»
15 years 1 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski
ECCV
2002
Springer
16 years 2 months ago
Using Robust Estimation Algorithms for Tracking Explicit Curves
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
MC
2001
116views Computer Science» more  MC 2001»
15 years 3 months ago
Emotions and Multimodal Interface-Agents: A Sociological View
Designing human-computer interfaces that are easy and intuitive to use is important for the use of computer technology in general. Due to the growing complexity of information sys...
Daniel Moldt, Christian von Scheve
118
Voted
SEMWEB
2010
Springer
14 years 11 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...