Sciweavers

1565 search results - page 281 / 313
» cluster 2006
Sort
View
COR
2006
96views more  COR 2006»
14 years 9 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
79
Voted
COR
2006
140views more  COR 2006»
14 years 9 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
80
Voted
CORR
2006
Springer
113views Education» more  CORR 2006»
14 years 9 months ago
Decentralized Maximum Likelihood Estimation for Sensor Networks Composed of Nonlinearly Coupled Dynamical Systems
Abstract--In this paper, we propose a decentralized sensor network scheme capable to reach a globally optimum maximum-likelihood (ML) estimate through self-synchronization of nonli...
Sergio Barbarossa, Gesualdo Scutari
CSDA
2006
84views more  CSDA 2006»
14 years 9 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
CSDA
2006
82views more  CSDA 2006»
14 years 9 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin