Sciweavers

1013 search results - page 19 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
GECCO
2004
Springer
15 years 5 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
DCC
2006
IEEE
15 years 3 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
ICAC
2006
IEEE
15 years 5 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
EOR
2006
79views more  EOR 2006»
14 years 11 months ago
Equilibrium constrained optimization problems
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
15 years 6 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl