Sciweavers

7228 search results - page 64 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
14 years 4 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
15 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
EC
2008
120views ECommerce» more  EC 2008»
14 years 9 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
15 years 3 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
15 years 3 months ago
On addressing the run-cost variance in randomized motion planners
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
Pekka Isto, Martti Mäntylä, Juha O. Tuom...