Sciweavers

4843 search results - page 752 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
JIRS
2000
105views more  JIRS 2000»
15 years 3 months ago
The Formula One Tire Changing Robot (F1-T.C.R.)
: Formula One racing is one of the most fascinating sports ever, it is a perfect combination of high speed, technology, pressure and danger. One problem associated with car racing ...
Raul Mihali, Tarek M. Sobh
130
Voted
JUCS
2002
131views more  JUCS 2002»
15 years 3 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
126
Voted
MP
2002
110views more  MP 2002»
15 years 3 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski
151
Voted
NECO
1998
171views more  NECO 1998»
15 years 3 months ago
Constrained Optimization for Neural Map Formation: A Unifying Framework for Weight Growth and Normalization
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...
Laurenz Wiskott, Terrence J. Sejnowski
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 3 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani