Sciweavers

2178 search results - page 123 / 436
» Inferring complex plans
Sort
View
ACSAC
2005
IEEE
15 years 9 months ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia
171
Voted
ECAI
2004
Springer
15 years 9 months ago
Learning Complex and Sparse Events in Long Sequences
The Hierarchical Hidden Markov Model (HHMM) is a well formalized tool suitable to model complex patterns in long temporal or spatial sequences. Even if effective algorithms are ava...
Marco Botta, Ugo Galassi, Attilio Giordana
112
Voted
ECCC
2008
108views more  ECCC 2008»
15 years 3 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
132
Voted
CEC
2008
IEEE
15 years 10 months ago
Policy evolution with Genetic Programming: A comparison of three approaches
— In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is now much more complex. Subt...
Yow Tzu Lim, Pau-Chen Cheng, John Andrew Clark, Pa...
144
Voted
CIBCB
2005
IEEE
15 years 9 months ago
Feedback Memetic Algorithms for Modeling Gene Regulatory Networks
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
Christian Spieth, Felix Streichert, Jochen Supper,...