721 search results - page 19 / 145 » On Generators of Random Quasigroup Problems |
EUROGP
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
AMC
2004
13 years 7 months ago
2004
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
COMBINATORICS
2000
13 years 7 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
ICN
2001
Springer
14 years 11 days ago
2001
Springer
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...