Results 241 to 250 of about 335,404 (286)
Some of the next articles are maybe not open access.
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM, 1977A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different algorithms, suggesting a rank order of their quality.
de Champeaux, Dennis, Sint, Lenie
openaire +1 more source
2017 Seventh International Conference on Innovative Computing Technology (INTECH), 2017
Metaheuristic algorithms (MH's) are referred to algorithms which has a two-level design — ‘meta’ is upper-level procedure that controls the underlying ‘heuristic’ which learns and improves a solution iteratively until a sufficiently good solution is obtained for an optimization problem.
openaire +1 more source
Metaheuristic algorithms (MH's) are referred to algorithms which has a two-level design — ‘meta’ is upper-level procedure that controls the underlying ‘heuristic’ which learns and improves a solution iteratively until a sufficiently good solution is obtained for an optimization problem.
openaire +1 more source
2013
In this chapter a new optimization method is presented, called the Heuristic Kalman Algorithm (HKA). This new algorithm is proposed as an alternative approach for solving continuous non-convex optimization problems. The principle of HKA is to consider explicitly the optimization problem as a measurement process intended to give an estimate of the ...
openaire +1 more source
In this chapter a new optimization method is presented, called the Heuristic Kalman Algorithm (HKA). This new algorithm is proposed as an alternative approach for solving continuous non-convex optimization problems. The principle of HKA is to consider explicitly the optimization problem as a measurement process intended to give an estimate of the ...
openaire +1 more source
Heuristic Algorithms for Single Row Routing
IEEE Transactions on Computers, 1987A heuristic algorithm, based on the criterion of having nets with larger cut numbers assigned to inner tracks and nets with smaller cut numbers assigned to outer tracks, for single row routing problem has recently been proposed by Tarng et al. It has been reported that this algorithm has always been able to produce the optimal solutions for all the ...
Du, David Hung-Chang, Liu, Lee-Chin Hsu
openaire +1 more source
1993
This chapter describes fundamental algorithms and heuristics used by ANALYZE for some of its commands. The purpose of this presentation is to deepen one’s understanding of the results obtained from syntax-based explanations (EXPLAIN and SYNTAX commands) and from the TRACE, BASIS, RATEOF and REDUCE commands.
openaire +1 more source
This chapter describes fundamental algorithms and heuristics used by ANALYZE for some of its commands. The purpose of this presentation is to deepen one’s understanding of the results obtained from syntax-based explanations (EXPLAIN and SYNTAX commands) and from the TRACE, BASIS, RATEOF and REDUCE commands.
openaire +1 more source
Metaheuristic algorithms represent a key area of optimization research that generates interest for many academicians and researchers in today's technology landscape. Researchers have been using these methods as a problem-solving approach for many decades when applied to combinatorial optimization problems, which has now grown into a significant ...
Arshiya Begum, Asfia Sabahath
openaire +1 more source
Arshiya Begum, Asfia Sabahath
openaire +1 more source
IEEE Micro, 1983
This algorithm, implemented on an inexpensive microcomputer, solved a sophisticated operations research problem.
openaire +1 more source
This algorithm, implemented on an inexpensive microcomputer, solved a sophisticated operations research problem.
openaire +1 more source
A Study of Composite Heuristic Algorithms
Journal of the Operational Research Society, 1987When faced with a difficult combinatorial problem whose optimization may be prohibitively expensive, researchers frequently turn to the stuy of fast heuristic algorithms in an effort to guarantee near-optimal results. An important aspect in the evaluation of such an algorithm is the determination of its worst-case behaviour, relative to an optimization
openaire +2 more sources
Hybrid heuristic algorithms for Set Covering
Computers & Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A heuristic for blocking flow algorithms
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources