Results 61 to 70 of about 1,237,463 (291)
Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm
Algorithms, 2020 An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems.
Tamer F. Abdelmaguid
doaj +1 more source
Improved Distributed Algorithms for Exact Shortest Paths
, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source
Cytoplasmic p21 promotes stemness of colon cancer cells via activation of the NFκB pathway
Molecular Oncology, EarlyView.Cytoplasmic p21 promotes colorectal cancer stem cell (CSC) features by destabilizing the NFκB–IκB complex, activating NFκB signaling, and upregulating BCL‐xL and COX2. In contrast to nuclear p21, cytoplasmic p21 enhances spheroid formation and stemness transcription factor CD133.
Arnatchai Maiuthed +10 more
wiley +1 more source
Molecular Oncology, EarlyView.The noncoding region of the genome plays a key role in regulating gene expression, and mutations within these regions are capable of altering it. Researchers have identified multiple functional noncoding mutations associated with increased cancer risk in the genome of breast cancer patients.
Arnau Cuy Saqués +3 more
wiley +1 more source
Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms
BRICS Report Series, 2004 Inspired by the Maximum Satisfiability and Exact Satisfiability problems we present two Maximum Exact Satisfiability problems. The first problem called Maximum Exact Satisfiability is: given a formula in conjunctive normal form and an integer k, is there an assignment to all variables in the formula such that at least k clauses have exactly one true ...
Madsen, B.A., Rossmanith, P.
openaire +3 more sources
Exact algorithms for maximum independent set [PDF]
Information and Computation, 2013 We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.
Xiao, Mingyu, Nagamochi, Hiroshi
openaire +2 more sources
Exact Geosedics and Shortest Paths on Polyhedral Surface [PDF]
, 2007 We present two algorithms for computing distances along a non-convex polyhedral surface. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the ...
Balasubramanian, Mukund +2 more
core +1 more source
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Exact and Approximation Algorithms for Clustering [PDF]
Algorithmica, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agarwal, P. K., Procopiuc, C. M.
openaire +1 more source
An exact block algorithm for no-idle RPQ problem
Archives of Control Sciences, 2017 In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine.
Pempera Jaroslaw
doaj +1 more source