Sciweavers

1024 search results - page 61 / 205
» Value complete, column complete, predicate complete
Sort
View
ICFCA
2009
Springer
15 years 11 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
IPPS
2000
IEEE
15 years 8 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
AIPS
2007
15 years 6 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
CIDR
2009
105views Algorithms» more  CIDR 2009»
15 years 5 months ago
Teaching an Old Elephant New Tricks
In recent years, column stores (or C-stores for short) have emerged as a novel approach to deal with read-mostly data warehousing applications. Experimental evidence suggests that...
Nicolas Bruno
ESWA
2008
162views more  ESWA 2008»
15 years 4 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang