CEC
2008
IEEE
13 years 5 months ago
2008
IEEE
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
SODA
1997
ACM
13 years 5 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
NIPS
1998
13 years 5 months ago
1998
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...
WSC
2004
13 years 6 months ago
2004
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
FLAIRS
2004
13 years 6 months ago
2004
A new objective function for neural net classifier design is presented, which has more free parameters than the classical objective function. An iterative minimization technique f...
LREC
2008
13 years 6 months ago
2008
The ultimate goal when building dialogue systems is to satisfy the needs of real users, but quality assurance for dialogue strategies is a non-trivial problem. The applied evaluat...
ICONIP
2008
13 years 6 months ago
2008
Abstract. While injecting weight noise during training has been proposed for more than a decade to improve the convergence, generalization and fault tolerance of a neural network, ...
CCCG
2007
13 years 6 months ago
2007
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
CIMAGING
2010
13 years 6 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
Multiagent coordination algorithms provide unique insights into the challenging problem of alleviating traffic congestion. What is particularly interesting in this class of proble...