Sciweavers

5580 search results - page 969 / 1116
» Randomized priority algorithms
Sort
View
CP
2003
Springer
14 years 2 months ago
Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabri...
FPL
2003
Springer
119views Hardware» more  FPL 2003»
14 years 2 months ago
Hardware Implementations of Real-Time Reconfigurable WSAT Variants
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
Roland H. C. Yap, Stella Z. Q. Wang, Martin Henz
GECCO
2003
Springer
14 years 2 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 2 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
14 years 2 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener