Sciweavers

2899 search results - page 60 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CEC
2007
IEEE
15 years 7 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
GECCO
2005
Springer
15 years 7 months ago
Optimizing parameters of a mobile ad hoc network protocol with a genetic algorithm
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...
David J. Montana, Jason Redi
TEC
2008
88views more  TEC 2008»
15 years 1 months ago
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal M...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 1 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
EGH
2003
Springer
15 years 6 months ago
An optimized soft shadow volume algorithm with real-time performance
In this paper, we present several optimizations to our previously presented soft shadow volume algorithm. Our optimizations include tighter wedges, heavily optimized pixel shader ...
Ulf Assarsson, Michael Dougherty, Michael Mounier,...