Results 211 to 220 of about 51,613 (264)

On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs [PDF]

Fundamenta Informaticae, 2014
In this paper we study heuristic proof systems and heuristic non-deterministic algorithms. We give an example of a language Y and a polynomial-time samplable distribution D such that the distributional problem (Y, D) belongs to the complexity class HeurNP but Y ∉ NP if NP ≠ coNP, and (Y, D) ∉ HeurBPP if (NP,PSamp) $\nsubseteq$ HeurBPP. For a language L
Itsykson, Dmitry, Sokolov, Dmitry
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

Algorithms, approximations, and heuristics

2001
This chapter, indeed the whole of this book, is based on three axioms: 1. Machine vision is an engineering discipline, not a mathematical or philosophical exercise. 2. There is no unique way to perform any given image-processing function; every algorithm can be implemented in many different ways. 3.
Bruce Batchelor, Frederick Waltz
openaire   +1 more source

An Improved Bidirectional Heuristic Search Algorithm

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.
de Champeaux, Dennis, Sint, Lenie
openaire   +1 more source

Meta-zoo-heuristic algorithms

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

Heuristic Kalman Algorithm

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

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 ...
Du, David Hung-Chang, Liu, Lee-Chin Hsu
openaire   +1 more source

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

Meta Heuristic Algorithm

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

A Heuristic Routing Algorithm

IEEE Micro, 1983
This algorithm, implemented on an inexpensive microcomputer, solved a sophisticated operations research problem.
openaire   +1 more source