We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...