Sciweavers

3422 search results - page 145 / 685
» Random Subset Optimization
Sort
View
131
Voted
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 12 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
ICPR
2004
IEEE
16 years 6 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 5 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
FOCS
2009
IEEE
15 years 11 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
CEC
2008
IEEE
15 years 11 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng