Sciweavers

1464 search results - page 205 / 293
» Behavioral optimization using the manipulation of timing con...
Sort
View
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 14 days ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
ANOR
2011
117views more  ANOR 2011»
13 years 12 days ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
HPDC
2006
IEEE
14 years 2 months ago
Replicating Nondeterministic Services on Grid Environments
Replication is a technique commonly used to increase the availability of services in distributed systems, including grid and web services. While replication is relatively easy for...
Xianan Zhang, Flavio Junqueira, Matti A. Hiltunen,...
EAAI
2010
119views more  EAAI 2010»
13 years 7 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
NHM
2010
87views more  NHM 2010»
13 years 3 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...