Sciweavers

92 search results - page 6 / 19
» Optimal sequencing by hybridization in rounds
Sort
View
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 4 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
COR
2010
119views more  COR 2010»
13 years 7 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
CHES
2007
Springer
154views Cryptology» more  CHES 2007»
14 years 1 months ago
Multi-gigabit GCM-AES Architecture Optimized for FPGAs
Abstract. This paper presents a design-space exploration of the Galois/Counter Mode (GCM) algorithm with Advanced Encryption Standard (AES) as underlying block cipher for high thro...
Stefan Lemsitzer, Johannes Wolkerstorfer, Norbert ...
SIROCCO
2008
13 years 9 months ago
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Er...
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...