Sciweavers

13376 search results - page 209 / 2676
» Problem Solving with
Sort
View
CP
2005
Springer
15 years 9 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
125
Voted
ICA
2007
Springer
15 years 7 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
COR
2007
108views more  COR 2007»
15 years 3 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
DAM
2007
94views more  DAM 2007»
15 years 3 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
ESWA
2010
175views more  ESWA 2010»
15 years 2 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin