Sciweavers

4894 search results - page 176 / 979
» Dynamic Abstraction Planning
Sort
View
COMPSEC
2004
91views more  COMPSEC 2004»
15 years 4 months ago
Predicting the intrusion intentions by observing system call sequences
Identifying the intentions or attempts of the monitored agents through observations is very vital in computer network security. In this paper, a plan recognition method for predict...
Li Feng, Xiaohong Guan, Sangang Guo, Yan Gao, Pein...
IJCAI
2003
15 years 5 months ago
Writer's Aid: Using a Planner in a Collaborative Interface
Writer’s Aid is a collaborative system that works simultaneously with an author editing a document providing assistance in identifying and inserting citation keys and autonomous...
Tamara Babaian, Barbara J. Grosz, Stuart M. Shiebe...
ICTAI
2010
IEEE
15 years 1 months ago
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
The abstract goes here.
Neng-Fa Zhou, Yoshitaka Kameya, Taisuke Sato
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 4 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
FSR
2007
Springer
135views Robotics» more  FSR 2007»
15 years 10 months ago
State Space Sampling of Feasible Motions for High Performance Mobile Robot Navigation in Highly Constrained Environments
Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence ...
Thomas M. Howard, Colin J. Green, Alonzo Kelly