Sciweavers

2178 search results - page 150 / 436
» Inferring complex plans
Sort
View
129
Voted
IUI
2004
ACM
15 years 9 months ago
Choosing when to interact with learners
In this paper, we describe a method for pedagogical agents to choose when to interact with learners in interactive learning environments. This method is based on observations of h...
Lei Qu, Ning Wang, W. Lewis Johnson
144
Voted
ECP
1997
Springer
92views Robotics» more  ECP 1997»
15 years 8 months ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
139
Voted
ICLP
2007
Springer
15 years 7 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
147
Voted
SAC
2005
ACM
15 years 9 months ago
A complex biological database querying method
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
Jake Yue Chen, John V. Carlis, Ning Gao
154
Voted
ISCA
2003
IEEE
169views Hardware» more  ISCA 2003»
15 years 9 months ago
Virtual Simple Architecture (VISA): Exceeding the Complexity Limit in Safe Real-Time Systems
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, ...