نتایج جستجو برای: random search

تعداد نتایج: 563066  

Journal: :CoRR 2017
Lisa Hellerstein Tom Lidbetter

We present efficient algorithms for computing optimal or approximately optimal strategies in a zero-sum game for which Player I has n pure strategies and Player II has an arbitrary number of pure strategies. We assume that for any given mixed strategy of Player I, a best response or “approximate” best response of Player II can be found by an oracle in time polynomial in n. We then show how our ...

2012
Muntasir Al-Asfoor Brendan Neville Maria Fasli

The work presented in this paper has addressed the issue of resource sharing in dynamic heterogeneous Multi Agent Systems as a search problem. When performing a random search, this might lead to traverse the whole network and increase the failure ratio. This paper has introduced heuristic directed search based on the usage of an approximate matching mechanism to overcome this problem. Our imple...

2001
Hantao Zhang

Recent work on the combinatorial search has provided experimental and theoretical evidence that randomization and restart strategies proposed by Gomes, Selman, and Kautz, can be very effective for backtrack search algorithms to solve some hard satisfiable instances of SAT. One difficulty of effectively using the restart strategy is its potential conflict with the branching heuristic. It is well...

2013
Matteo Fischetti Andrea Lodi Michele Monaci Domenico Salvagnin Andrea Tramontani

We discuss the variability in the performance of multiple runs of Mixed Integer Linear solvers, and we concentrate on the one deriving from the use of different optimal bases of the Linear Programming relaxations. We propose a new algorithm exploiting more than one of those bases and we show that different versions of the algorithm can be used to stabilize and improve the performance of the sol...

2014
Ryan Leary Walter Andrews

This paper describes a system for indexing acoustic feature vectors for large-scale speaker search using random projections. Given one or more target feature vectors, large-scale speaker search enables returning similar vectors (in a nearest-neighbors fashion) in sublinear time. The speaker feature space is comprised of i-vectors, derived from Gaussian Mixture Model supervectors. The index and ...

1998
Hans-Michael Voigt

| For the calibration of laser induced plasma spectrometers robust and eecient local search methods are required. Therefore, several local optimizers from nonlinear optimization, random search and evolutionary computation are compared. It is shown that evolutionary algorithms are superior with respect to reliability and eeciency. To enhance the local search of an evolutionary algorithm a new me...

2014
Gayatree Ganu Amélie Marian

Online forums are a vital resource for users to ask questions and to participate in discussions. Yet, the search functionality on such forum sites is very primitive; posts containing the searched keywords are retrieved in the order of their creation date. In these interactive and social web forum sites, users frequently make connections with other users due to shared interests, same information...

2009
Gleb Oshanin Katja Lindenberg Horacio S Wio Sergei Burlatsky Laboratory J.-V. Poncelet Independent University of Moscow Russia LPTMC University PierreMarie CurieCNRS Paris France Department of Chemistry Biochemistry University of California at San Diego USA Instituto de Fisica de Cantabria Santander Spain United Technologies Research Center East Hartford

We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability α or go off lattice with probability 1−α to move in a random direction until it lands back on the lattice at a fixed distance L ...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2012
Andrew M Hein Scott A McKinley

Many organisms locate resources in environments in which sensory signals are rare, noisy, and lack directional information. Recent studies of search in such environments model search behavior using random walks (e.g., Lévy walks) that match empirical movement distributions. We extend this modeling approach to include searcher responses to noisy sensory data. We explore the consequences of incor...

2008
Mauro Brunato Roberto Battiti

This paper presents an adaptive stochastic search algorithm for the optimization of functions of continuous variables where the only hypothesis is the pointwise computability of the function. The main design criterion of the proposed scheme consists of the adaptation of a search region by an affine transformation which takes into account the local knowledge derived from trial points generated w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید