Results 31 to 40 of about 9,457,899 (319)
Level Based Routing Using Dynamic Programming for 2D Mesh
Cybernetics and Information Technologies, 2017 The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm.
Punhani Akash +2 more
doaj +1 more source
Holographic subregion complexity from kinematic space
Journal of High Energy Physics, 2019 We consider the computation of volumes contained in a spatial slice of AdS3 in terms of observables in a dual CFT. Our main tool is kinematic space, defined either from the bulk perspective as the space of oriented bulk geodesics, or from the CFT ...
Raimond Abt +4 more
doaj +1 more source
Intersection Space Constructible Complexes
Documenta Mathematica, 2020 We present an obstruction theoretic inductive construction of intersection space pairs, which generalizes Banagl's construction of intersection spaces for arbitraty depth stratifications. We construct intersection space pairs for pseudomanifolds with compatible trivial structures at the link fibrations; this includes the case of toric varieties.
Agustín Vicente, Marta +1 more
openaire +3 more sources
Complexity in de Sitter space [PDF]
Classical and Quantum Gravity, 2017 29 pages, v2: references ...
Reynolds, Alan P., Ross, Simon F.
openaire +3 more sources
Entropy, 2019 In this study we use theoretical concepts and computational-diagnostic tools of Tsallis non-extensive statistical theory (Tsallis q-triplet: q s e n , q r e l , q s t a t ), complemented by other known tools of nonlinear ...
Evgenios G. Pavlos +5 more
doaj +1 more source
Pebble Games, Proof Complexity, and Time-Space Trade-offs [PDF]
Logical Methods in Computer Science, 2013 Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying
Jakob Nordstrom
doaj +1 more source
Workspace and Singularity analysis of a Delta like family robot [PDF]
, 2015 Workspace and joint space analysis are essential steps in describing the task and designing the control loop of the robot, respectively. This paper presents the descriptive analysis of a family of delta-like parallel robots by using algebraic tools to ...
A Pashkevich +15 more
core +4 more sources
Duality and quasi-normability for complexity spaces
Applied General Topology, 2002 The complexity (quasi-metric) space was introduced in [23] to study complexity analysis of programs. Recently, it was introduced in [22] the dual complexity (quasi-metric) space, as a subspace of the function space [0,) ω. Several quasi-metric properties
Salvador Romaguera, M.P. Schellekens
doaj +1 more source
Toward the nonequilibrium thermodynamic analog of complexity and the Jarzynski identity
Journal of High Energy Physics, 2022 The Jarzynski identity can describe small-scale nonequilibrium systems through stochastic thermodynamics. The identity considers fluctuating trajectories in a phase space. The complexity geometry frames the discussions on quantum computational complexity
Chen Bai, Wen-Hao Li, Xian-Hui Ge
doaj +1 more source
Space-Time Complexity in Hamiltonian Dynamics
, 2003 New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'', trappings, weak ...
Brudno A. A. +7 more
core +1 more source