Sciweavers

14649 search results - page 287 / 2930
» Principles of problem solving
Sort
View
CP
2005
Springer
16 years 4 days 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
ICA
2007
Springer
15 years 10 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...
EAAI
2008
104views more  EAAI 2008»
15 years 6 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
TCS
2011
15 years 1 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
ICIP
2008
IEEE
16 years 1 months ago
An iterative algorithm for linear inverse problems with compound regularizers
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
José M. Bioucas-Dias, Mário A. T. Fi...