Sciweavers

4229 search results - page 106 / 846
» On the Optimality of Spiral Search
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 8 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
ICAART
2010
INSTICC
15 years 10 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
CP
2005
Springer
15 years 6 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
EVOW
2001
Springer
15 years 5 months ago
Design of Iterated Local Search Algorithms
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
Matthijs den Besten, Thomas Stützle, Marco Do...
WWW
2007
ACM
16 years 1 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas