Sciweavers

5115 search results - page 337 / 1023
» On Randomized Lanczos Algorithms
Sort
View
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
16 years 24 days ago
Subquadratic Algorithms for 3SUM
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
Ilya Baran, Erik D. Demaine, Mihai Patrascu
HIPC
2003
Springer
16 years 16 days ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
GECCO
2006
Springer
122views Optimization» more  GECCO 2006»
15 years 11 months ago
Genetic algorithms are suitable for driving microbial ecosystems in desirable directions
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
Frederik P. J. Vandecasteele, Thomas F. Hess, Rona...
FOCS
2000
IEEE
15 years 11 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
IJCAI
2007
15 years 8 months ago
Adaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
Nga Lam Law, Kwok Yip Szeto