Sciweavers

2354 search results - page 322 / 471
» Randomness, Stochasticity and Approximations
Sort
View

Publication
216views
15 years 10 months ago
Dynamic Matching with a Fall-Back Option
We study dynamic matching without money when one side of the market is dynamic with arrivals and de- partures and the other is static and agents have strict prefer- ences over a...
Sujit Gujar, David Parkes
AUSAI
2007
Springer
15 years 10 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
AIPS
2007
15 years 8 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 7 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard