Results 1  10
of
13,676
On heuristic optimization
 An. Stiint. Univ. Ovidius Constanta
"... In the late 1960’s is was postulated that there exists a class of combinatorial problems with inherent complexity that any technique of solving such problems to optimality requires computational effort that increases polynomially with the size of the problem. These problems are called NPhard proble ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the late 1960’s is was postulated that there exists a class of combinatorial problems with inherent complexity that any technique of solving such problems to optimality requires computational effort that increases polynomially with the size of the problem. These problems are called NP
Tutorial: Heuristic Optimization
 Purdue University
, 1995
"... Although it is seriously underrepresented in most academic programs, heuristic optimizationoptimumseeking methods explicitly aimed at good feasible solutions that may not be optimalcomprises most of the optimization work actually applied in industrial engineering practice. This tutorial surveys s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Although it is seriously underrepresented in most academic programs, heuristic optimizationoptimumseeking methods explicitly aimed at good feasible solutions that may not be optimalcomprises most of the optimization work actually applied in industrial engineering practice. This tutorial surveys
Euclidean Heuristic Optimization
 PROCEEDINGS OF THE TWENTYFIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 2011
"... We pose the problem of constructing good search heuristics as an optimization problem: minimizing the loss between the true distances and the heuristic estimates subject to admissibility and consistency constraints. For a wellmotivated choice of loss function, we show performing this optimization i ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We pose the problem of constructing good search heuristics as an optimization problem: minimizing the loss between the true distances and the heuristic estimates subject to admissibility and consistency constraints. For a wellmotivated choice of loss function, we show performing this optimization
Heuristic Optimization of Microcontrollers
 Proc. 18th Design Automation Conf
, 1981
"... The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law.
Experimental evaluation of heuristic optimization algorithms: A tutorial
 Journal of Heuristics
, 2001
"... Heuristic optimization algorithms seek good feasible solutions to optimization problems in circumstances where the complexities of the problem or the limited time available for solution do not allow exact solution. Although worst case and probabilistic analysis of algorithms have produced insight on ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
Heuristic optimization algorithms seek good feasible solutions to optimization problems in circumstances where the complexities of the problem or the limited time available for solution do not allow exact solution. Although worst case and probabilistic analysis of algorithms have produced insight
Tuning & Simplifying Heuristical Optimization
, 2010
"... This thesis is about the tuning and simplification of blackbox (directsearch, derivativefree) optimization methods, which by definition do not use gradient information to guide their search for an optimum but merely need a fitness (cost, error, objective) measure for each candidate solution to th ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This thesis is about the tuning and simplification of blackbox (directsearch, derivativefree) optimization methods, which by definition do not use gradient information to guide their search for an optimum but merely need a fitness (cost, error, objective) measure for each candidate solution
Heuristically optimized tradeoffs: a new paradigm for power laws in the internet
, 2002
"... Abstract We give a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [5] based on a toy model of Internet growth in which two objectives are optimized simultaneously: "last mile " connection costs, and transmissi ..."
Abstract

Cited by 178 (1 self)
 Add to MetaCart
Abstract We give a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [5] based on a toy model of Internet growth in which two objectives are optimized simultaneously: "last mile " connection costs
HEUROPA: Heuristic Optimization of Parallel Computations
 In !EuroARCH '93
, 1993
"... . The performance of almost all parallel algorithms and systems can be improved by the use of heuristics that affect the parallel execution. However, since optimal guidance usually depends on many different influences, establishing such heuristics is often difficult. Due to the importance of heurist ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. The performance of almost all parallel algorithms and systems can be improved by the use of heuristics that affect the parallel execution. However, since optimal guidance usually depends on many different influences, establishing such heuristics is often difficult. Due to the importance
The ant colony optimization metaheuristic
 in New Ideas in Optimization
, 1999
"... Ant algorithms are multiagent systems in which the behavior of each single agent, called artificial ant or ant for short in the following, is inspired by the behavior of real ants. Ant algorithms are one of the most successful examples of swarm intelligent systems [3], and have been applied to many ..."
Abstract

Cited by 389 (23 self)
 Add to MetaCart
Ant algorithms are multiagent systems in which the behavior of each single agent, called artificial ant or ant for short in the following, is inspired by the behavior of real ants. Ant algorithms are one of the most successful examples of swarm intelligent systems [3], and have been applied to many types of problems, ranging from the classical traveling salesman
The Ant System: Optimization by a colony of cooperating agents
 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICSPART B
, 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract

Cited by 1300 (46 self)
 Add to MetaCart
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed
Results 1  10
of
13,676