Sciweavers

3142 search results - page 405 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
88
Voted
ICAISC
2004
Springer
15 years 6 months ago
Visualization of Hidden Node Activity in Neural Networks: II. Application to RBF Networks
Scatterograms of the images of training set vectors in the hidden space help to evaluate the quality of neural network mappings and understand internal representations created by t...
Wlodzislaw Duch
91
Voted
IDA
2003
Springer
15 years 5 months ago
Very Predictive Ngrams for Space-Limited Probabilistic Models
In sequential prediction tasks, one repeatedly tries to predict the next element in a sequence. A classical way to solve these problems is to fit an order-n Markov model to the da...
Paul R. Cohen, Charles A. Sutton
115
Voted
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
15 years 4 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
NIPS
2008
15 years 2 months ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari
ADCM
2005
79views more  ADCM 2005»
15 years 15 days ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu