Sciweavers

531 search results - page 10 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...
IEICET
2010
124views more  IEICET 2010»
13 years 5 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
JMLR
2012
11 years 10 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
GLOBECOM
2009
IEEE
14 years 2 months ago
Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems
— A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where...
Amir Hamed Mohsenian Rad, Vahid Shah-Mansouri, Vin...
FOCS
2009
IEEE
14 years 2 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