Sciweavers

1568 search results - page 134 / 314
» The problem of examination questions in algorithmics
Sort
View
136
Voted
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
15 years 5 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
ANOR
2011
101views more  ANOR 2011»
14 years 11 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao
161
Voted
ICS
2010
Tsinghua U.
16 years 2 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
IJCNN
2008
IEEE
15 years 11 months ago
Numerical condition of feedforward networks with opposite transfer functions
— Numerical condition affects the learning speed and accuracy of most artificial neural network learning algorithms. In this paper, we examine the influence of opposite transfe...
Mario Ventresca, Hamid R. Tizhoosh
131
Voted
AUSAI
2001
Springer
15 years 8 months ago
Fast Text Classification Using Sequential Sampling Processes
A central problem in information retrieval is the automated classification of text documents. While many existing methods achieve good levels of performance, they generally require...
Michael D. Lee