نتایج جستجو برای: two stage heuristic
تعداد نتایج: 2731230 فیلتر نتایج به سال:
Standardized and objective design criteria for evaluating web-based learning platforms can effectively distinguish the quality of a platform and, therefore, contribute in improving web-based learning outcomes. This is a two-phase study, in which Delphi technique and heuristic evaluation were employed in the first phase to develop the evaluation criteria and scale of web-based learning platforms...
The Principal Ideal Problem (resp. Short Principal Ideal Problem), shorten as PIP (resp. SPIP), consists in finding a generator (resp. short generator) of a principal ideal in the ring of integers of a number field. Several lattice-based cryptosystems rely on the presumed hardness of these two problems. In practice, most of them do not use an arbitrary number field but a power-of-two cyclotomic...
The purely propositional representation traditionally used to express AI planning problems is not adequate to express numeric variables when modeling real-world continuous resources. This paper presents a heuristic planning approach that uses a richer representation with capabilities for numeric variables, including durations of actions, and multiobjective optimisation. The approach consists of...
Today, University Timetabling problems are occurred annually and they are often hard and time consuming to solve. This paper describes Hyper Heuristics (HH) method based on Great Deluge (GD) and its variants for solving large, highly constrained timetabling problems from different domains. Generally, in hyper heuristic framework, there are two main stages: heuristic selection and move acceptanc...
This paper investigates the hybrid flowshop scheduling with finite intermediate buffers, whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the d...
Abstract Background: Rehabilitation of facial paralysis is one of the greatest challenges faced by reconstructive surgeons today. The traditional method for treatment of patients with facial palsy is the two-stage free gracilis flap which has a long latency period of between the two stages of surgery. Methods: In this paper, we prospectively compared the results of the one-stage gracilis flap ...
In this study, an approach for damage detection of large-scale structures is developed by employing kinetic and modal strain energies and also Heuristic Particle Swarm Optimization (HPSO) algorithm. Kinetic strain energy is employed to determine the location of structural damages. After determining the suspected damage locations, the severity of damages is obtained based on variations of modal ...
this study aimed to identify and rank the most important environmental factors for the popularity of recreational sports in iran. only those sensitive aspects of the environment to which recreational sports should react were considered in order to survive. this study was performed consecutively in two qualitative and quantitative phases by mixed heuristic method. for this purpose the experts of...
There are two main approches to the fuzzy regression (more precisely: regression in fuzzy environment): the least of sum of distances (including two methods of least squared errors and least absolute errors) and the possibilistic method (the method of least whole vaguness under some restrictions). Beside, some heuristic methods have been proposed to deal with fuzzy regression. Some o...
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید