Sciweavers

6769 search results - page 1073 / 1354
» A new concept of robustness
Sort
View
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
16 years 5 days ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
16 years 5 days ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
ICCS
2005
Springer
16 years 5 days ago
Fast Expression Templates
Abstract. Expression templates (ET) can significantly reduce the implementation effort of mathematical software. For some compilers, especially for those of supercomputers, it ca...
Jochen Härdtlein, Alexander Linke, Christoph ...
ICN
2005
Springer
16 years 5 days ago
A Fast Path Recovery Mechanism for MPLS Networks
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...
Jenhui Chen, Chung-Ching Chiou, Shih-Lin Wu
138
Voted
ICS
2005
Tsinghua U.
16 years 5 days ago
Tasking with out-of-order spawn in TLS chip multiprocessors: microarchitecture and compilation
Chip Multiprocessors (CMPs) are flexible, high-frequency platforms on which to support Thread-Level Speculation (TLS). However, for TLS to deliver on its promise, CMPs must explo...
Jose Renau, James Tuck, Wei Liu, Luis Ceze, Karin ...
« Prev « First page 1073 / 1354 Last » Next »