Cargando…
Analyzing Non-deterministic Computable Aggregations
Traditionally, the term aggregation is associated with an aggregation function, implicitly assuming that any aggregation process can be represented by a function. However, the concept of computable aggregation considers that the core of the aggregation processes is the program that enables it. This...
Autores principales: | Garmendia, Luis, Gómez, Daniel, Magdalena, Luis, Montero, Javier |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7274690/ http://dx.doi.org/10.1007/978-3-030-50143-3_43 |
Ejemplares similares
-
A Semi-Deterministic Random Walk with Resetting
por: Villarroel, Javier, et al.
Publicado: (2021) -
Deterministic networks for probabilistic computing
por: Jordan, Jakob, et al.
Publicado: (2019) -
Development and validation of predictive models for unplanned hospitalization in the Basque Country: analyzing the variability of non-deterministic algorithms
por: Olza, Alexander, et al.
Publicado: (2023) -
Non-Deterministic Semantics for Quantum States
por: Jorge, Juan Pablo, et al.
Publicado: (2020) -
Deterministic Global Optimization
por: Scholz, Daniel
Publicado: (2012)