Results 61 to 70 of about 5,507,173 (401)

Computing as a service pattern based on edge computing

open access: yesDianzi Jishu Yingyong, 2019
Edge computing is a computational model for all terminal devices from cloud to edge path, which emerges in the era of interconnection of all things. The existing server pattern under cloud computing model cannot satisfy the application requirements of ...
Wang Tengfei   +5 more
doaj   +1 more source

Computational intelligence and soft computing: some thoughts on already explored and not yet explored paths [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2010
We comment upon the very essence, roots, potentials, and applicability of computational intelligence and soft computing. We followed a different path than those traditionally employed, and which are so well and in a deep and comprehensive way documented ...
Janusz Kacprzyk
doaj   +1 more source

Iterative Dynamic Critical Path Scheduling: An Efficient Technique for Offloading Task Graphs in Mobile Edge Computing

open access: yesApplied Sciences, 2022
Recent years have witnessed a paradigm shift from centralized cloud computing to decentralized edge computing. As a key enabler technique in edge computing, computation offloading migrates computation-intensive tasks from resource-limited devices to ...
Bo Xu   +5 more
doaj   +1 more source

Revisiting Vision Transformer from the View of Path Ensemble [PDF]

open access: yesarXiv, 2023
Vision Transformers (ViTs) are normally regarded as a stack of transformer layers. In this work, we propose a novel view of ViTs showing that they can be seen as ensemble networks containing multiple parallel paths with different lengths. Specifically, we equivalently transform the traditional cascade of multi-head self-attention (MSA) and feed-forward
arxiv  

Explicit Computational Paths

open access: yes, 2016
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are proofs that $a$ and $b$ are equal elements of type $A$.
Ramos, Arthur Freitas   +2 more
openaire   +2 more sources

Towards knowledge-enriched path computation [PDF]

open access: yesProceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014
Accepted as a short paper at ACM SIGSPATIAL GIS ...
Mario A. Nascimento   +6 more
openaire   +3 more sources

Computational Paths and the Fundamental Groupoid of a Type

open access: yesAnais do VI Encontro de Teoria da Computação (ETC 2021), 2021
Using computational paths as the fundamental concept, we show that we can leverage Category Theory to propose the concept of fundamental groupoid of a type.
Arthur F. Ramos   +2 more
openaire   +4 more sources

Enhanced FRER Mechanism in Time-Sensitive Networking for Reliable Edge Computing

open access: yesSensors
Time-Sensitive Networking (TSN) and edge computing are promising networking technologies for the future of the Industrial Internet. TSN provides a reliable and deterministic low-latency communication service for edge computing.
Shaoliu Hu   +3 more
doaj   +1 more source

Computing Resolution-Path Dependencies in Linear Time

open access: yes, 2012
The alternation of existential and universal quantifiers in a quantified boolean formula (QBF) generates dependencies among variables that must be respected when evaluating the formula. Dependency schemes provide a general framework for representing such
Slivovsky, Friedrich, Szeider, Stefan
core   +1 more source

Line-distortion, Bandwidth and Path-length of a graph [PDF]

open access: yes, 2014
We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta   +15 more
core   +1 more source

Home - About - Disclaimer - Privacy