Sciweavers

14165 search results - page 508 / 2833
» The generalized two-server problem
Sort
View
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
16 years 15 days ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni
ICCS
2005
Springer
16 years 14 days ago
Disjoint Segments with Maximum Density
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang
MFCS
2005
Springer
16 years 14 days ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
16 years 13 days ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
PPSN
2004
Springer
16 years 9 days ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson