Sciweavers

543 search results - page 52 / 109
» A Theory of Plan Modification
Sort
View
JAIR
2008
173views more  JAIR 2008»
14 years 9 months ago
Computational Logic Foundations of KGP Agents
This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous...
Antonis C. Kakas, Paolo Mancarella, Fariba Sadri, ...
COMPSEC
2004
91views more  COMPSEC 2004»
14 years 9 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...
DCC
2006
IEEE
15 years 9 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
EGOV
2007
Springer
15 years 4 months ago
Towards a Methodology for Designing E-Government Control Procedures
The EU is currently modernizing customs legislation and practices. Main pillars in the new vision are an intensive use of IT (Customs becomes eCustoms), partnerships between Custom...
Ziv Baida, Jianwei Liu, Yao-Hua Tan
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 1 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi