Sciweavers

1912 search results - page 333 / 383
» GOAL as a Planning Formalism
Sort
View
IJAR
2007
130views more  IJAR 2007»
15 years 6 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
SP
2008
IEEE
162views Security Privacy» more  SP 2008»
15 years 6 months ago
Fable: A Language for Enforcing User-defined Security Policies
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...
Nikhil Swamy, Brian J. Corcoran, Michael Hicks
IPL
2007
96views more  IPL 2007»
15 years 6 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
AI
2004
Springer
15 years 6 months ago
Logic-based subsumption architecture
We describe a logic-based AI architecture based on Brooks' subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL...
Eyal Amir, Pedrito Maynard-Zhang
FMSD
2002
81views more  FMSD 2002»
15 years 6 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann