Sciweavers

1453 search results - page 41 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
ICTAI
2007
IEEE
14 years 2 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
AE
2005
Springer
14 years 1 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
PAAPP
2006
141views more  PAAPP 2006»
13 years 7 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
ESA
2005
Springer
99views Algorithms» more  ESA 2005»
14 years 1 months ago
Optimizing a 2D Function Satisfying Unimodality Properties
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
Erik D. Demaine, Stefan Langerman
IRREGULAR
1995
Springer
13 years 11 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...