Sciweavers

7522 search results - page 337 / 1505
» Spacing memetic algorithms
Sort
View
SPAA
2003
ACM
16 years 1 days ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
CEC
2007
IEEE
15 years 10 months ago
A versatile quantum-inspired evolutionary algorithm
Abstract-- This study points out some weaknesses of existing Quantum-Inspired Evolutionary Algorithms (QEA) and explains in particular how hitchhiking phenomenons can slow down the...
Michael Defoin-Platel, Stefan Schliebs, Nikola Kas...
NIPS
2004
15 years 8 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 11 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo