Sciweavers

6943 search results - page 812 / 1389
» Representations for evolutionary algorithms
Sort
View
EDCC
2005
Springer
16 years 21 days ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...
LCPC
2005
Springer
16 years 20 days ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick
JCDL
2004
ACM
94views Education» more  JCDL 2004»
16 years 18 days ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
FATES
2004
Springer
16 years 17 days ago
Online Testing of Real-time Systems Using Uppaal
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...
GD
2004
Springer
16 years 17 days ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner