Sciweavers

14165 search results - page 239 / 2833
» The generalized two-server problem
Sort
View
IDA
2009
Springer
15 years 11 months ago
Bayesian Solutions to the Label Switching Problem
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
Kai Puolamäki, Samuel Kaski
SIGIR
2009
ACM
15 years 11 months ago
Protein identification as an information retrieval problem
We present the first interdisciplinary work on transforming a popular problem in proteomics, i.e. protein identification from tandem mass spectra, to an Information Retrieval (IR)...
Yiming Yang, Subramaniam Ganapathy, Abhay Harpale
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 11 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 11 months ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
15 years 11 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...