Sciweavers

501 search results - page 20 / 101
» Event-Feeded Dimension Solution
Sort
View
DAM
2007
94views more  DAM 2007»
14 years 11 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 9 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
ICCSA
2003
Springer
15 years 5 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
MCS
2008
Springer
14 years 11 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
15 years 4 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros