Sciweavers

567 search results - page 21 / 114
» Reconstructing Numbers from Pairwise Function Values
Sort
View
COMBINATORICS
2002
84views more  COMBINATORICS 2002»
13 years 8 months ago
Compositions of Random Functions on a Finite Set
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
Avinash Dalal, Eric Schmutz
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
14 years 1 months ago
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 8 months ago
Distributed Source Coding in the Presence of Byzantine Sensors
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
Oliver Kosut, Lang Tong
ICANN
2007
Springer
13 years 10 months ago
Solving Selected Classification Problems in Bioinformatics Using Multilayer Neural Network Based on Multi-Valued Neurons (MLMVN)
A multilayer neural network based on multi-valued neurons (MLMVN) is a new powerful tool for solving classification, recognition and prediction problems. This network has a number ...
Igor N. Aizenberg, Jacek M. Zurada
COLT
2007
Springer
14 years 2 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin