681 search results - page 6 / 137 » Searching with expectations |
IMCS
2007
13 years 10 months ago
2007
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
FOCS
1989
IEEE
14 years 2 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...
CP
2008
Springer
14 years 20 days ago
2008
Springer
Abstract. We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point ...
JGO
2010
13 years 9 months ago
2010
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...