نتایج جستجو برای: random hill climbing algorithm

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

1999
Bruce Edmonds Scott Moss

In many markets, customer preferences depend on the activity of the customer. The authors have previously demonstrated a model that allows the testing of the qualitative judgements of domain experts in spirits markets against relevant EPOS price and sales data. This paper extends the use of context dependent customer preferences to the case where domain experts lack confidence in their judgemen...

Journal: :Measurement 2021

The freeform surface adaptive interferometer (FSAI) recently has been employed to realize the unknown metrology. A near null interferogram should be acquired from initial with undistinguished fringes even dark areas. direct optimization object in FSAI is just rather than focusing intensity characterization traditional wavefront-sensorless (WFS) systems. simulated annealing-hill climbing (SA-HC)...

Journal: :J. Global Optimization 2004
Sheldon H. Jacobson Enver Yücesan

Generalized hill climbing algorithms provide a framework for modeling several local search algorithms for hard discrete optimization problems. This paper introduces and analyzes generalized hill climbing algorithm performance measures that reflect how effectively an algorithm has performed to date in visiting a global optimum and how effectively an algorithm may perform in the future in visitin...

Journal: :Pattern Recognition Letters 2014
Guillermo Sánchez-Díaz German Diaz-Sanchez Miguel Mora-González Iván Piza-Dávila Carlos Aguirre-Salado Guillermo Huerta-Cuéllar Oscar Reyes-Cardenas Abraham Cardenas-Tristan

This paper is focused on introducing a hill-climbing algorithm as a way to solve the problem of generating typical testors -or non-reducible descriptorsfrom a training matrix. All the algorithms reported in the state-of-the-art have exponential complexity. However, there are problems for which there is no need to generate the whole set of typical testors, but it suffices to find only a subset o...

Journal: :International Journal for Research in Applied Science and Engineering Technology 2021

1997
Chris Thornton

Genetic Algorithms (GAs) are increasingly used for such purposes as deriving programs 1] and producing designs for robots 2]. According to the building-block hypothesis and schema analysis of Holland 3] the GA is an eecient search method. However, empirical work has shown that in some cases the method is outperformed by simpler processes such as random-permutation hill climbing 4] and 5]. The p...

2011
Mark Withall Chris Hinde Tom Jackson Iain Phillips

Rolling stock allocation is the process of assigning timetable schedules to physical train units. This is primarily done by connecting together schedules at their terminal locations (known as schedule associations). Platforming allocation is the process of assigning those associations to particular platforms. A simple last-in, first-legal-out algorithm is used for rolling stock allocation that ...

1998
Jieyu Zhao

Reinforcement learning based on direct search in policy space requires few assumptions about the environment. Hence it is applicable in certain situations where most traditional reinforcement learning algorithms based on dynamic programming are not, especially in partially observable, deterministic worlds. In realistic settings, however, reliable policy evaluations are complicated by numerous s...

Journal: :Physical Review D 2018

Journal: :Journal of the Experimental Analysis of Behavior 1983

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

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