Sciweavers

1648 search results - page 50 / 330
» On the generation of bicliques of a graph
Sort
View
VIZSEC
2004
Springer
15 years 7 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
ICALT
2006
IEEE
15 years 7 months ago
Hybrid System for Generating Learning Object Metadata
– Generating LOM for learning material is a complex and tedious task to be manually completed. Therefore, the current trend is to automate this process. However, there are severa...
Olivier Motelet, Nelson A. Baloian
AIPS
2007
15 years 3 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
ENTCS
2006
162views more  ENTCS 2006»
15 years 1 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
JAIR
2008
99views more  JAIR 2008»
15 years 1 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson