Sciweavers

5580 search results - page 639 / 1116
» Randomized priority algorithms
Sort
View
ICNC
2005
Springer
15 years 10 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 10 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
15 years 10 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
15 years 10 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
SETA
2004
Springer
126views Mathematics» more  SETA 2004»
15 years 10 months ago
Algebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...
Andrew Klapper