Results 261 to 270 of about 75,020 (311)

A heuristic algorithm for the fanout problem

Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90, 1990
We present an algorithm to optimally distribute a signal to its required destinations. The choice of the buffers and the topology of the distribution tree depends on the availability of different strength gates and on the load and the required times at the destinations. The general problem is to construct a fanout-tree for a signal so that the required
Kanwar Jit Singh, Alberto L. Sangiovanni-Vincentelli   +1 more
openaire   +1 more source

An Improved Bidirectional Heuristic Search Algorithm [PDF]

Journal of the ACM, 1977
A 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.
Dennis de Champeaux, Lenie Sint
openaire   +1 more source

Heuristic algorithm for retrieving containers

Computers & Industrial Engineering, 2016
We propose heuristic algorithm which makes container retrieval efficiently.We show the validity and efficiency of the algorithm by solving sample problems.The proposed algorithm decreases great amount of solving time.The proposed algorithm reduces the number of container movements.The proposed algorithm reduces the crane's working time.
Yongmin Kim, Taeho Kim, Hongchul Lee
openaire   +1 more source

Optimization of Chemical Synthesis with Heuristic Algorithms

SSRN Electronic Journal, 2022
Heuristic algorithms have been used in optimizing cross-coupling yields.
Jialu Chen, Wenjun Xu, Ruiqin Zhang
openaire   +2 more sources

Learning heuristics by genetic algorithms

Proceedings of the 1995 conference on Asia Pacific design automation (CD-ROM) - ASP-DAC '95, 1995
In many applications of Computer Aided Design (CAD) of Integrated Circuits (ICs) the problems that have to be solved are NP-hard. Thus, exact algorithms are only applicable to small problem instances and many authors have presented heuristics to obtain solutions (non-optimal in general) for larger instances of these hard problems.
Rolf Drechsler, Bernd Becker 0001
openaire   +1 more source

A heuristic algorithm for network equilibration

Applied Mathematics and Computation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. H. Xu, William H. K. Lam, Hu Shao, G. F. Luan   +3 more
openaire   +1 more source

A Study of Composite Heuristic Algorithms

Journal of the Operational Research Society, 1987
When 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

Heuristic algorithms for the triangulation of graphs

1995
Different uncertainty propagation algorithms in graphical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from different triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resulting triangulated graph.
Andrés Cano, Serafín Moral
openaire   +1 more source

A hyper-heuristic clustering algorithm

2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2012
The so-called heuristics have been widely used in solving combinatorial optimization problems because they provide a simple but effective way to find an approximate solution. These technologies are very useful for users who do not need the exact solution but who care very much about the response time. For every existing heuristic algorithm has its pros
Chun-Wei Tsai, Huei-Jyun Song, Ming-Chao Chiang   +2 more
openaire   +1 more source

Algorithms and Heuristics in VLSI Design

2002
The increasing complexity of nowadays VLSI designs makes it hard up to impossible to check their correctness by using validation methods like simulation. Therefore there is is a growing demand for formal verification methods in VLSI design and verification.
Christoph Meinel, Christian Stangier
openaire   +1 more source