Results 31 to 40 of about 265,994 (263)
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90, 1990 In this paper we show that it is impossible to solve a number of “natural” two-dimensional geometric problems in polylog time with a polynomial number of processors (unless P=NC). Thus, we disprove a popular belief that there are no natural P-complete geometric problems in the plane.
Mikhail J. Atallah +2 more
openaire +2 more sources
A Survey of Matrix Completion Methods for Recommendation Systems
Big Data Mining and Analytics, 2018 In recent years, the recommendation systems have become increasingly popular and have been used in a broad variety of applications. Here, we investigate the matrix completion techniques for the recommendation systems that are based on collaborative ...
Andy Ramlatchan +5 more
doaj +1 more source
Theoretical Approaches Parallel Identical Machines with Multi-Objective Functions
Al-Mustansiriyah Journal of Science, 2022 In this study, we propose multi-objective functions which consist of the sum of completion time, tardiness time and earliness time where Ci denoted the completion time of job (i), Ti=max{Ci-di,0}, denotes the tardiness of job (i), Ei=max{di-Ci,0} be ...
Fahim Mohammed Ibrahim +2 more
doaj +1 more source
Complete Register Allocation Problems [PDF]
SIAM Journal on Computing, 1973 The search for efficient register allocation algorithms dates back to the time of the first FORTRAN compiler for the IBM 704.
openaire +2 more sources
A HYPONORMAL TOEPLITZ COMPLETION PROBLEM [PDF]
Glasgow Mathematical Journal, 2013 AbstractIn this paper we consider the following ‘Toeplitz completion’ problem: Complete the unspecified analytic Toeplitz entries of the partial block Toeplitz matrix $ \begin{linenomath} A:=\begin{bmatrix} T_{\overline\psi_1}& ?\\[4pt] \T_{\overline\psi_2} \end{bmatrix} \end{linenomath} $ to make A hyponormal, where ψi∈H∞ is a non-constant ...
Hwang, In Sung, Kim, An Hyun
openaire +2 more sources
Orthogonal random projection for tensor completion
IET Computer Vision, 2020 The low‐rank tensor completion problem, which aims to recover the missing data from partially observable data. However, most of the existing tensor completion algorithms based on Tucker decomposition cannot avoid using singular value decomposition (SVD ...
Yali Feng, Guoxu Zhou
doaj +1 more source
Data Completion of Air Quality Index Based on Multi-dimensional Sparse Representation [PDF]
Jisuanji kexue, 2023 In recent years,air pollution has become increasingly serious and become one of the risk factors affecting people's health.The air quality index(AQI) can provide the government with the laws of atmospheric environment changes,and can also be used for air
CAI Qiquan, LU Juhong, YU Zhiyong, HUANG Fangwan
doaj +1 more source
Mathematics, 2023 We propose a vehicle routing problem with time windows (VRPTW) with compatibility-matching constraints and total completion time as the objective function, with applications in home healthcare routing and scheduling.
Payakorn Saksuriya, Chulin Likasiri
doaj +1 more source
Problems, solutions, and completions
The Journal of Logic and Algebraic Programming, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Strong Parrott Completion Problem [PDF]
Proceedings of the American Mathematical Society, 1993 In this paper we parametrize all solutions of the Strong Parrott problem and obtain necessary and sufficient conditions for existence of isometric, coisometric, and unitary solutions.
Bakonyi, Mihály, Woerdeman, Hugo J.
openaire +2 more sources