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

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

M. Pourmahyabadi,

In this article, Hill Climbing (HC) and Estimation of Distribution Algorithm (EDA) are integrated to produce a hybrid intelligent algorithm for design of endlessly Single Mode Photonic Crystal Fibers (SMPCFs) structure with desired properties over the C communication band. In order to analyzing the fiber components, Finite Difference Frequency Domain (FDFD) solver is applied. In addition, a spe...

2011
Shanu Sharma

One of the basic problems of user on manual wheelchair is overcoming architectural barriers (kerbs, stairs etc.) on its way. Even though many research studies have been reported in different fields to increase the independence of wheelchair users, the question of overcoming obstacles by a wheelchair always remains as topic of discussion for many researchers. In this paper, the author has propos...

ژورنال: مدیریت شهری 2016
Rezaei, Sajjad, Zorriassatine, Farbod ,

No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...

2010
CAMELIA CHIRA

Evolutionary algorithms and hill-climbing search models are investigated to address the protein structure prediction problem. This is a well-known NP-hard problem representing one of the most important and challenging problems in computational biology. The pull move operation is engaged as the main local search operator in several approaches to protein structure prediction. The considered appro...

1999
Michael S. Lew Thomas S. Huang

The coarse-to-fine search strategy is extensively used in current reported research. However, it has the same problems as any hill climbing algorithm, most importantly, it often finds local instead of global minima. Drawing upon the artificial intelligence literature, we applied an optimal graph search, namely A*, to the problem. Using real stereo and video test sets, we compared the A* method ...

2008
Stephan Chalup Frederic Maire

Hill climbing algorithms can train neural control systems for adaptive agents. They are an alternative to gradient descent algorithms especially if neural networks with non-layered topology or non-differentiable activation function are used, or if the task is not suitable for backpropagation training. This paper describes three variants of generic hill climbing algorithms which together can tra...

2002
Simon M Garrett Joanne H Walker

The ability to track dynamic functional optima is important in many practical tasks. Recent research in this area has concentrated on modifying evolutionary algorithms (EAs) by triggering changes in control parameters, ensuring population diversity, or remembering past solutions. A set of results are presented that favourably compare hill climbing with a genetic algorithm, and reasons for the r...

Journal: :MATEC web of conferences 2022

The article deals with the issues of operating wheelchairs manual drive in areas a significant inclination angle. kinematics wheelchair while climbing hill was analyzed. On basis conclusions drawn from research, two solutions for systems that block reversal on have been proposed. Among mentioned, mechanical anti-rollback system three modes and an electric is described. described part manual-ele...

1998
Martin Buehler R. Battaglia A. Cocosco Geoff Hawker J. Sarkis K. Yamazaki

M. Buehler, R. Battaglia, A. Cocosco, G. Hawker, J. Sarkis, K. Yamazaki. Centre for Intelligent Machines, McGill University, Montr eal, QC H3A 2A7, Canada Abstract A simple mechanical design for quadrupedal locomotion, termed SCOUT, is proposed, featuring only one degree of freedom per leg. This paper demonstrates experimentally that our rst prototype SCOUT-1 is capable of walking, turning, and...

Journal: :Discrete Applied Mathematics 2004
Martin Grüttmüller

This paper deals with completion of partial latin squares L = (lij) of order n with k cyclically generated diagonals (li+t,j+t = lij + t if lij is not empty; with calculations modulo n). There is special emphasis on cyclic completion. Here, we present results for k = 2, . . . , 7 and odd n ≤ 21, and we describe the computational method used (hill-climbing). Noncyclic completion is investigated ...

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

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