Results 21 to 30 of about 1,048 (100)
Multiband gravitational-wave event rates and stellar physics [PDF]
, 2019 Joint gravitational-wave detections of stellar-mass black-hole binaries by ground- and space-based observatories will provide unprecedented opportunities for fundamental physics and astronomy.
Belczynski, Krzysztof +6 more
core +4 more sources
Hierarchies of turing machines with restricted tape alphabet size [PDF]
, 1975 It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[bnr] can accept more sets than those operating in space L2(n)=[anr] provided the number of work tapes and tape alphabet size are held fixed.
Ibarra, Oscar H., Sahni, Sartaj K.
core +1 more source
Preserving energy resp. dissipation in numerical PDEs using the "Average Vector Field" method
, 2012 We give a systematic method for discretizing Hamiltonian partial differential equations (PDEs) with constant symplectic structure, while preserving their energy exactly. The same method, applied to PDEs with constant dissipative structure, also preserves
Celledoni, E. +6 more
core +1 more source
Optimal control for the thin-film equation: Convergence of a multi-parameter approach to track state constraints avoiding degeneracies [PDF]
, 2015 We consider an optimal control problem subject to the thin-film equation which is deduced from the Navier--Stokes equation. The PDE constraint lacks well-posedness for general right-hand sides due to possible degeneracies; state constraints are used to ...
Klein, Markus, Prohl, Andreas
core +1 more source
Alternating and empty alternating auxiliary stack automata [PDF]
, 2003 We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited.
Holzer, Markus, McKenzie, Pierre
core +1 more source
Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space
Applied SciencesThis article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. The Euclidean Steiner problem involves finding the minimum spanning network that connects a given set of ...
Michał Bereta
doaj +1 more source
More Than 1700 Years of Word Equations
, 2015 Geometry and Diophantine equations have been ever-present in mathematics. Diophantus of Alexandria was born in the 3rd century (as far as we know), but a systematic mathematical study of word equations began only in the 20th century. So, the title of the
A Boudet +10 more
core +1 more source
The Complexity of Number Theory
, 2020 The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes.
F. Vega
semanticscholar +1 more source
Tree-size bounded alternation [PDF]
, 1980 The size of an accepting computation tree of an alternating Turing machine (ATM) is introduced as a complexity measure. We present a number of applications of tree-size to the study of more traditional complexity classes.
Ruzzo, Walter L.
core +1 more source
Passively Mobile Communicating Logarithmic Space Machines [PDF]
, 2010 We propose a new theoretical model for passively mobile Wireless Sensor Networks. We call it the PALOMA model, standing for PAssively mobile LOgarithmic space MAchines. The main modification w.r.t.
Chatzigiannakis, Ioannis +4 more
core