Results 51 to 60 of about 3,508,326 (346)

Timely-Throughput Optimal Coded Computing over Cloud Networks [PDF]

open access: yes, 2019
In modern distributed computing systems, unpredictable and unreliable infrastructures result in high variability of computing resources. Meanwhile, there is significantly increasing demand for timely and event-driven services with deadline constraints ...
Ananthanarayanan Ganesh   +5 more
core   +2 more sources

Computing the non-computable [PDF]

open access: yesContemporary Physics, 2003
Extensively revised and enlarged with: 2 new subsections, 4 new figures, 1 new reference, and a short biography as requested by the journal ...
openaire   +4 more sources

Compute-in-Memory for Numerical Computations

open access: yesMicromachines, 2022
In recent years, compute-in-memory (CIM) has been extensively studied to improve the energy efficiency of computing by reducing data movement. At present, CIM is frequently used in data-intensive computing. Data-intensive computing applications, such as all kinds of neural networks (NNs) in machine learning (ML), are regarded as ‘soft’ computing tasks.
Dongyan Zhao   +11 more
openaire   +3 more sources

Why Computation?

open access: yes, 2017
This paper reviews my personal inclinations and fascination with the area of unconventional computing. Computing can be perceived as an inscription in a "Rosetta Stone," one category akin to physics, and therefore as a form of comprehension of nature: at
Svozil, Karl
core   +1 more source

Population and species neighbor identity impact trait–trait relationships and plant performance

open access: yesPopulation Ecology, EarlyView.
We evaluated how populations and species identity influence plant performance and trait outcomes in mixtures, and assessed trait variation among populations of two forb species native to the western United States (Dieteria canescens and Heterotheca villosa) following three interaction treatments (single‐population monoculture, two‐population mixture ...
Alicia J. Foxx   +2 more
wiley   +1 more source

Computational geometry and discrete computations [PDF]

open access: yes, 1996
In this paper we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side algorithms designed for continuous data and on the other ...
openaire   +7 more sources

Contemporary art, capitalization and the blockchain: On the autonomy and automation of art's value

open access: yesFinance and Society, 2016
This article addresses contemporary art as a means to investigate how, and to what extent, financial logic impacts upon the socio-cultural sphere. Its contribution is twofold: on the one hand, the article shows that contemporary art's valuation practices
Laura Lotti
doaj   +1 more source

Optical Quantum Computation

open access: yes, 2009
We review the field of Optical Quantum Computation, considering the various implementations that have been proposed and the experimental progress that has been made toward realizing them.
Pryde, G. J., Ralph, T. C.
core   +1 more source

Effects of chronic browsing on life‐history traits of an irruptive large herbivore population

open access: yesPopulation Ecology, EarlyView.
This study aimed to determine the relationship between diet quality, body mass, and size (hind foot length), and female reproduction and sought to identify the mechanism by which high density under severe food limitations is maintained. Our results demonstrated that sika deer introduced to Nakanoshima Island have maintained high densities through high ...
Koichi Kaji   +9 more
wiley   +1 more source

On Computability of Computable Problems [PDF]

open access: yesarXiv, 2023
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can execute any algorithm therefore every computable problem is Turing computable.
arxiv  

Home - About - Disclaimer - Privacy