6142 search results - page 283 / 1229 » The Complexity of Partition Functions |
166
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
166
click to vote
CONCUR
2004
Springer
15 years 12 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
147
click to vote
SPIRE
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
176
click to vote
GLVLSI
2003
IEEE
15 years 12 months ago
2003
IEEE
It is likely that it will become increasingly difficult to manufacture the complex, heterogeneous logic structures that characterise current reconfigurable logic systems. As a res...
187
click to vote
PPSN
1992
Springer
15 years 10 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...