Results 71 to 80 of about 4,174,426 (295)
KOALA GRAPH THEORY INTERNET SERVICE
TASK Quarterly, 2015 KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization.
TOMASZ GOLUCH +2 more
doaj +1 more source
Non-Local Probes Do Not Help with Graph Problems
, 2015 This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to
Göös, Mika +4 more
core +1 more source
Algorithms, Algorithms, Algorithms [PDF]
Computer, 2020 James Bret Michael, Jeffrey M. Voas
openaire +1 more source
Algorithmic Pricing and Algorithmic Collusion
Business & Information Systems EngineeringThe rise of algorithmic pricing in online retail platforms has attracted significant interest in how autonomous software agents interact under competition. This article explores the potential emergence of algorithmic collusion - supra-competitive pricing outcomes that arise without explicit agreements - as a consequence of repeated interactions between
Durmann, Julius +2 more
openaire +3 more sources
Analysis of Algorithms and Partial Algorithms [PDF]
, 2016 We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and ...
openaire +2 more sources
Computer Science Review, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ross M. McConnell +3 more
openaire +3 more sources
Algorithms and Their Explanations [PDF]
, 2014 By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise example of how to deal with algorithmic knowledge. To do so, we introduce a concept already implicit in the method, the ‘gradient of explanations’.
BENINI, MARCO, GOBBO, FEDERICO
openaire +3 more sources
Molecular Oncology, EarlyView.Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
Variational quantum generative modeling by sampling expectation values of tunable observables
npj Quantum InformationExpectation Value Samplers (EVSs) are quantum generative models that can learn high-dimensional continuous distributions by measuring the expectation values of parameterized quantum circuits. However, these models can demand impractical quantum resources
Kevin Shen +5 more
doaj +1 more source
Analysis of an algorithm catching elephants on the Internet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub +3 more
doaj +1 more source