Results 271 to 280 of about 75,020 (311)

Algorithms and Heuristics

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

An admissible heuristic search algorithm

1993
This paper introduces an admissible heuristic search algorithm — Search and Learning Algorithm (SLA*). SLA* is developed from the work presented by Korf in the Learning-Real-Time-Algorithm (LRTA*). We retain the major elements of Korfs work in LRTA*, and improve its performance by incorporating a review component to fully reflect the effect the ...
Li-Yen Shue, Reza Zamani
openaire   +1 more source

An Heuristic Algorithm for Handling Multiple Responses

Journal of Heuristics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Satratzemi, Constantine Tsouros, Frank Harary   +2 more
openaire   +2 more sources

A heuristic algorithm for stroke extraction

1988
An algorithm for extraction of strokes of handwritten and printed Chinese characters is described. The main idea is based on the heuristic information of Chinese character structure. Experiment shows that strokes can be extracted efficiently according to the heuristic strategy. The general distribution of terminal points is analysed by means of Polya's
X. F. Yin, Dongzhuang Su
openaire   +1 more source

Exact and heuristic algorithms for routing problems [PDF]

4OR, 2010
This is a summary of the authors PhD thesis supervised by Daniele Vigo and defended on 30 March 2010, at the Universita di Bologna. The thesis is written in English and is available from the author upon request. Several rich routing problems attaining to the transportation area have been studied.
openaire   +2 more sources

A heuristic for blocking flow algorithms

European Journal of Operational Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Heuristic Algorithm for the Vehicle-Dispatch Problem

Operations Research, 1974
This paper introduces and illustrates an efficient algorithm, called the sweep algorithm, for solving medium- as well as large-scale vehicle-dispatch problems with load and distance constraints for each vehicle. The locations that are used to make up each route are determined according to the polar-coordinate angle for each location.
Billy E. Gillett, Leland R. Miller
openaire   +2 more sources

Heuristic Algorithms for Single Row Routing

IEEE Transactions on Computers, 1987
A 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 ...
David Hung-Chang Du, Lee-Chin Hsu Liu
openaire   +1 more source

Heuristics and Genetic Algorithms

INCOSE International Symposium, 2006
AbstractGenetic algorithms are design tools used in generating optimal solutions. While they can often be shown to outperform various heuristic methods and hybrid approaches, using a combination of evolutionary algorithms and heuristic approaches can generate an optimal solution more quickly than either of the two methods independently.
Michael D. Mobley, Cihan H. Dagli, David Enke   +2 more
openaire   +1 more source

A Heuristic Optimal Reduct Algorithm

2000
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix.
Keyun Hu, Lili Diao, Yuchang Lu, Chunyi Shi   +3 more
openaire   +1 more source