Sciweavers

1158 search results - page 56 / 232
» Software is discrete mathematics
Sort
View
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
VOSS
2004
Springer
125views Mathematics» more  VOSS 2004»
14 years 2 months ago
Probabilistic Automata: System Types, Parallel Composition and Comparison
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
Ana Sokolova, Erik P. de Vink
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 19 days ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
14 years 19 days ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
DISOPT
2008
107views more  DISOPT 2008»
13 years 9 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin