نتایج جستجو برای: hyper coordinate

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

Journal: :Mathematics 2018

Journal: :Journal of Physics A: Mathematical and General 2002

Journal: :Electronic Journal of Graph Theory and Applications 2021

Journal: : 2022

The aim of this paper is to define hyper-Leonardo hybrinomials as a generalization the Leonardo Pisano and examine some their properties such recurrence relation, summation formula generating function. Another introduce hyper hybrid-Leonardo numbers.

2003
Limin Han Graham Kendall

We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find good quality solutions to given problems. The guided mutation and crossover hyper-GA, the focus of this paper, extends that work. The aim of a guided hyper-GA is to make the dynamic removal and insertion of heuristic...

2014
John H. Drake Ender Özcan Edmund K. Burke

Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work has shown that selection hyper-heuristics are able to solve many combinatorial optimisation problems, including the multidimensional 0-1 knapsack problem (MKP). The traditional framework ...

Journal: :the modares journal of electrical engineering 2015
mahdieh hosseingholizadeh alashti jafar heyrani nobari abdolhamid bahjat panah

in this paper, a new method for determining position and orientation of a coordinate system using its image is presented. this coordinate system is a three dimensional non-orthogonal system in respect to the two dimensional and orthogonal camera coordinate system.  in real world, it’s exactly easy to select three directions on an object so that they don’t be orthogonal and on a plane. the image...

Journal: :South African Computer Journal 2012
Nelishia Pillay

Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances. This paper examines the use of evolutionary algorithm (EA) selection hyper-heuristics to solve the offline one-dimensional bin-packing problem. Two EA hyper-heuristics are evaluated. The first (EA-HH1) searches a heuristic space of comb...

Journal: :Mathematical Programming 2015

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

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