5115 search results - page 325 / 1023 » On Randomized Lanczos Algorithms |
181
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
175
click to vote
SODA
1996
ACM
15 years 8 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
208
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
181
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
168
click to vote
JAIR
2006
15 years 7 months ago
2006
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...