Sciweavers

14548 search results - page 437 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
16 years 2 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
FOCS
2009
IEEE
15 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CP
2008
Springer
15 years 9 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
16 years 7 days ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant