Sciweavers

1483 search results - page 183 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 7 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
TCSV
2008
115views more  TCSV 2008»
15 years 1 months ago
Dynamic Proposal Variance and Optimal Particle Allocation in Particle Filtering for Video Tracking
Abstract--This paper presents a novel particle allocation approach to particle filtering which minimizes the total tracking distortion for a fixed number of particles over a video ...
Pan Pan, Dan Schonfeld
IEEEPACT
1998
IEEE
15 years 5 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 7 months ago
A novel ab-initio genetic-based approach for protein folding prediction
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
Sergio Raul Duarte Torres, David Camilo Becerra Ro...
CP
1999
Springer
15 years 5 months ago
The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
Benjamin W. Wah, Zhe Wu