Sciweavers

2157 search results - page 373 / 432
» Binary ant algorithm
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 4 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
KI
2001
Springer
15 years 4 months ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
Stefan Edelkamp, Ulrich Meyer
WCRE
2000
IEEE
15 years 4 months ago
Towards Portable Source Code Representations using XML
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
Evan Mamas, Kostas Kontogiannis
SIGMOD
2000
ACM
137views Database» more  SIGMOD 2000»
15 years 4 months ago
LOF: Identifying Density-Based Local Outliers
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common pattern...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
ICMCS
1999
IEEE
151views Multimedia» more  ICMCS 1999»
15 years 4 months ago
Construction of Virtual Environment for Endoscopy
In this paper, a technique is presented for CT image analysis and visualization of the bronchial airways. The technique provides a non-invasive way to examine the interior of the ...
Sven Loncaric, T. Markovinovic, T. Petrovic, D. Ra...