Sciweavers

1097 search results - page 165 / 220
» Testing Graph Isomorphism
Sort
View
ISCIS
2009
Springer
15 years 9 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 8 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
125
Voted
EUROGP
2007
Springer
164views Optimization» more  EUROGP 2007»
15 years 8 months ago
The Induction of Finite Transducers Using Genetic Programming
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...
Amashini Naidoo, Nelishia Pillay
MODELS
2007
Springer
15 years 8 months ago
Reconciling TGGs with QVT
ant Talks Abstracts Modelling Tools: Claudia Ermel: Tiger Harmen Kastenberg: GROOVE Christian Köhler: EMF Model Transformation Ákos Horváth: The VIATRA2 Model Transformation Fra...
Joel Greenyer, Ekkart Kindler
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 8 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck