Results 51 to 60 of about 146 (117)
Why Philosophers Should Care About Computational Complexity [PDF]
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Scott Aaronson, Aaronson, Scott
core
A New Implementation of Network GARCH Model for Stock Volatility and Co‐Volatility Forecasting
ABSTRACT Volatility clustering and spillovers are key features of financial time series with many cross‐sectional assets. While network analysis links similar or correlated stocks and helps trace volatility spillovers, contemporary multivariate ARCH‐GARCH formulations struggle to represent structured network dependence and remain parsimonious.
Peiyi Zhou
wiley +1 more source
ABSTRACT This paper investigates the b$$ b $$‐block single picker routing problem with scattered storage (b$$ b $$‐SPRP‐SS). For a parallel‐aisle warehouse comprising b$$ b $$ blocks, the b$$ b $$‐SPRP‐SS asks for the determination of a picker tour that minimizes travel distance while collecting all articles from a given pick list.
Stefan Irnich, Laura Lüke
wiley +1 more source
Probing and Graph Coloring Techniques for Trace Estimation in Lattice QCD
ABSTRACT The computation of Tr[D−1]$\mathrm{Tr}[D^{-1}]$, where D$D$ is the Wilson–Dirac matrix of Lattice QCD, is a fundamental and computationally demanding task with applications to disconnected hadronic correlation functions. Since D−1$D^{-1}$ is a dense matrix of prohibitive size, its trace cannot be computed exactly, and one must resort to ...
Mario Papace +5 more
wiley +1 more source
New spectra of computable models
Logic Colloquium ’10, the 2010 European Summer Meeting of the Association for Symbolic Logic, was hosted by the University of Paris Diderot (Paris 7) from 25 July to 31 July 2010. The lectures were held on the University Campus at Halle aux Farines.
Gavryushkin, A
core +2 more sources
A domain theoretic approach to computability on the real line
In recent years, there has been a considerable amount of work on using continuous domains in real analysis. Most notably are the development of the generalized Riemann integral with applications in fractal geometry, several extensions of the programming ...
Suenderhauf,P., Edalat,A.
core +1 more source
ABSTRACT Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI) and hybrid decoding to solve each of these two tasks.
Zenia Elise Damgaard Bæk +3 more
wiley +1 more source
Unified Stein‐Type Characterizations of Bivariate Count Distributions With Applications
ABSTRACT The derivation and application of Stein identities have received considerable research interest, especially for continuous distributions and univariate discrete distributions. In this article, we derive a unified Stein‐type characterization for three bivariate count models, namely the bivariate Poisson, type‐I bivariate binomial, and bivariate
Shaochen Wang, Christian H. Weiß
wiley +1 more source
Tensor‐Train Compression of a Volume Integral Eddy Current Problem in Discontinuous Galerkin
ABSTRACT The paper presents a low‐rank tensor compression strategy based on the tensor‐train (TT) format for the integral operator arising in eddy current problems. Unlike classical matrix compression techniques such as the fast multipole method (FMM) or hierarchical matrices (ℋ$$ \mathscr{H} $$‐matrices), which typically compress only far‐field ...
Anthony Torosyan +5 more
wiley +1 more source
Shape of Yield Curves Under Instrument‐Based Parallel Shifts
ABSTRACT This paper studies the shape of zero and par yield curves through the carry and convexity of zero‐bond and par–swap butterflies under instrument‐based parallel shifts: the component instruments are held fixed, and each instrument's own quote receives the same additive shock.
Jian Sun
wiley +1 more source

