Sciweavers

5606 search results - page 396 / 1122
» Randomization Techniques for Graphs.
Sort
View
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 12 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
INFOVIS
2000
IEEE
15 years 11 months ago
Visualizing Massive Multi-Digraphs
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
James Abello, Jeffrey L. Korn
DSN
2011
IEEE
14 years 6 months ago
Modeling stream processing applications for dependability evaluation
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
Gabriela Jacques-Silva, Zbigniew Kalbarczyk, Bugra...
ICPR
2004
IEEE
16 years 7 months ago
Graph Method for Generating Affine Moment Invariants
A general method of systematic derivation of affine moment invariants of any weights and orders is introduced. Each invariant is expressed by its generating graph. Techniques for ...
Jan Flusser, Tomás Suk
DAC
2006
ACM
16 years 7 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...