Sciweavers

4498 search results - page 182 / 900
» How to Invent Functions
Sort
View
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
15 years 7 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
15 years 6 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
NIPS
2004
15 years 5 months ago
Semi-supervised Learning on Directed Graphs
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
Dengyong Zhou, Bernhard Schölkopf, Thomas Hof...
ESANN
2000
15 years 5 months ago
Local input-output stability of recurrent networks with time-varying weights
Abstract. We present local conditions for input-output stability of recurrent neural networks with time-varying parameters introduced for instance by noise or on-line adaptation. T...
Jochen J. Steil
NIPS
1992
15 years 5 months ago
Network Structuring and Training Using Rule-Based Knowledge
We demonstrate in this paper how certain forms of rule-based knowledge can be used to prestructure a neural network of normalized basis functions and give a probabilistic interpre...
Volker Tresp, Jürgen Hollatz, Subutai Ahmad