Sciweavers

154 search results - page 10 / 31
» Anytime search in dynamic graphs
Sort
View
IEEEARES
2009
IEEE
14 years 3 months ago
A Mobile Ambients-Based Approach for Network Attack Modelling and Simulation
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
Virginia N. L. Franqueira, Pascal van Eck, Roel Wi...
KBSE
2005
IEEE
14 years 2 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
VLDB
2000
ACM
125views Database» more  VLDB 2000»
14 years 5 days ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 3 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
ICIP
2000
IEEE
14 years 9 months ago
Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
Frederic Guichard, Jean-Philippe Tarel