Sciweavers

16404 search results - page 514 / 3281
» A set coverage problem
Sort
View
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
16 years 1 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
ICCS
2007
Springer
16 years 1 months ago
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
Omar Bashir, Omar Ghattas, Judith Hill, Bart G. va...
ICIC
2007
Springer
16 years 1 months ago
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...
Shih-Hsin Chen, Pei-Chann Chang, Chien-Lung Chan, ...
CPAIOR
2005
Springer
16 years 12 days ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
CP
1997
Springer
15 years 11 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo