Sciweavers

7228 search results - page 39 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
JCPHY
2011
109views more  JCPHY 2011»
14 years 18 days ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
FOCS
2009
IEEE
15 years 4 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
INFOCOM
2007
IEEE
15 years 4 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann