Results 41 to 50 of about 98,734 (264)
Information, 2021 The current IT market is more and more dominated by the “cloud continuum”. In the “traditional” cloud, computing resources are typically homogeneous in order to facilitate economies of scale.
Juncal Alonso +6 more
doaj +1 more source
Algorithms for computing QoS paths with restoration [PDF]
IEEE/ACM Transactions on Networking, 2003 There is a growing interest among service providers to offer new services with quality of service (QoS) guaranties that are also resilient to failures. Supporting QoS connections requires the existence of a routing mechanism, that computes the QoS paths, i.e., paths that satisfy QoS constraints (e.g., delay or bandwidth). Resilience to failures, on the
Yigal Bejerano +4 more
openaire +2 more sources
Molecular Oncology, EarlyView.The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington +10 more
wiley +1 more source
On Computing the Path Number of a Graph
Electronic Notes in Theoretical Computer Science, 2019 Abstract Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a minimum number of elements is called the path number of G. Peroche (1984) proved that the problem of
Fábio Botler +2 more
openaire +1 more source
Towards knowledge-enriched path computation [PDF]
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014 Accepted as a short paper at ACM SIGSPATIAL GIS ...
Georgios Skoumas +6 more
openaire +2 more sources
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
Computing homotopic shortest paths efficiently [PDF]
Computational Geometry, 2002 12 pages, 11 ...
Alon Efrat +2 more
openaire +2 more sources
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
The Scientific World Journal, 2014 Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang +5 more
doaj +1 more source