Results 51 to 60 of about 5,507,173 (401)

A Strategic Value Appropriation Path for Cloud Computing

open access: yesJournal of Management Information Systems, 2018
Cloud-based information management is one of the leading competitive differentiation strategies for firms. With the increasing criticality of information management in value creation and process support, establishing an integrated capability with cloud ...
A. Kathuria   +4 more
semanticscholar   +1 more source

Centrifugal Compressor Polytropic Performance—Improved Rapid Calculation Results—Cubic Polynomial Methods

open access: yesInternational Journal of Turbomachinery, Propulsion and Power, 2021
This paper presents a new improved approach to calculation of polytropic performance of centrifugal compressors. This rapid solution technique is based upon a constant efficiency, temperature-entropy polytropic path represented by cubic polynomials.
Matt Taher, Fred Evans
doaj   +1 more source

Computing and Listing Avoidable Vertices and Paths

open access: yesAlgorithmica, 2022
AbstractA simplicial vertex of a graph is a vertex whose neighborhood is a clique. It is known that listing all simplicial vertices can be done in O(nm) time or $$O(n^{\omega })$$ O ( n ω )
Charis Papadopoulos, Athanasios E. Zisis
openaire   +2 more sources

Deep Reinforcement Learning for Collaborative Edge Computing in Vehicular Networks [PDF]

open access: yesIEEE Transactions on Cognitive Communications and Networking, 2020
Mobile edge computing (MEC) is a promising technology to support mission-critical vehicular applications, such as intelligent path planning and safety applications.
Mushu Li   +3 more
semanticscholar   +1 more source

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, vol. 27:2, Discrete Algorithms (May 1, 2025) dmtcs:13355, 2020
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ widely. We further unify these two graph classes by presenting the first recognition algorithm for both
arxiv   +1 more source

Shortest path computation with no information leakage [PDF]

open access: yesProceedings of the VLDB Endowment, 2012
Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
MOURATIDIS, Kyriakos, YIU, Man Lung
openaire   +4 more sources

Optimization and Prediction Techniques for Self-Healing and Self-Learning Applications in a Trustworthy Cloud Continuum

open access: yesInformation, 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

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs [PDF]

open access: yesarXiv, 2023
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing performance of a single query. However, in practice, it is more often that multiple HC-s-t path queries are issued simultaneously and processed as a batch.
arxiv  

When the path is never shortest: a reality check on shortest path biocomputation

open access: yes, 2017
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky   +28 more
core   +1 more source

East-West paths to unconventional computing [PDF]

open access: yesProgress in Biophysics and Molecular Biology, 2017
Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing.
Adamatzky A   +19 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy