Sciweavers

1120 search results - page 51 / 224
» Eager Markov Chains
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 5 months ago
On the stationary distribution of GAs with fixed crossover probability
We analyse the convergence of a GA when the mutation probability is low and the selection pressure is high, for arbitrary crossover types and probabilities. We succeed in mathemat...
U. Chandimal de Silva, Joe Suzuki
ECAI
2004
Springer
15 years 5 months ago
Generating Random Bayesian Networks with Constraints on Induced Width
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
Jaime Shinsuke Ide, Fabio Gagliardi Cozman, Fabio ...
EVOW
2009
Springer
15 years 4 months ago
The Evolution of Evolutionary Software: Intelligent Rhythm Generation in Kinetic Engine
This paper presents an evolutionary music software system that generates complex rhythmic polyphony in performance. A population of rhythms is derived from analysis of source mater...
Arne Eigenfeldt
CAAP
1990
15 years 3 months ago
A Markovian Concurrency Measure
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
Dominique Geniet, René Schott, Loÿs Th...
CORR
2004
Springer
83views Education» more  CORR 2004»
14 years 11 months ago
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
Guy Melançon, Fabrice Philippe