Sciweavers

79 search results - page 12 / 16
» GreatSPN Enhanced with Decision Diagram Data Structures
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
13 years 12 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
EMO
2006
Springer
87views Optimization» more  EMO 2006»
13 years 11 months ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...
BMCBI
2010
223views more  BMCBI 2010»
13 years 2 months ago
MetNetGE: interactive views of biological networks and ontologies
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
Ming Jia, Suh-Yeon Choi, Dirk Reiners, Eve Syrkin ...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 28 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
WABI
2007
Springer
14 years 1 months ago
Predicting Protein Folding Kinetics Via Temporal Logic Model Checking
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Christopher James Langmead, Sumit Kumar Jha