Results 41 to 50 of about 683,541 (259)
Sharp Bounds of Local Fractional Metric Dimensions of Connected Networks
IEEE Access, 2020 Metric dimension is a distance based parameter which is used to determine the locations of machines (or robots) with respect to minimum consumption of time, shortest distance among the destinations and lesser number of the utilized nodes as places of the
Muhammad Javaid +3 more
doaj +1 more source
A note on totally regular variables and Appell sequences in hypercomplex function theory [PDF]
, 2013 Series title : Lecture notes in computer science, vol. 7971, ISSN 0302-9743The aim of our contribution is to call attention to the relationship between totally regular variables, introduced by R. Delanghe in 1970, and Appell sequences with respect to the
F. Brackx +10 more
core +2 more sources
Optimizing Parallel Task Execution for Multi-Agent Mission Planning
IEEE Access, 2023 Multi-agent systems have received a tremendous amount of attention in many areas of research and industry, especially in robotics and computer science.
Branko Miloradovic +3 more
doaj +1 more source
The subdivision of large simplicial cones in Normaliz
, 2016 Normaliz is an open-source software for the computation of lattice points in rational polyhedra, or, in a different language, the solutions of linear diophantine systems.
T Achterberg, W Bruns, W Bruns, W Bruns
core +1 more source
Integer polyhedra for program analysis [PDF]
, 2009 Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the ...
A. Barvinok +19 more
core +2 more sources
A Nekrasov-Okounkov type formula for affine $\widetilde{C}$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$.
Mathias Pétréolle
doaj +1 more source
, 2017 Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability.
Morin, Pat +2 more
core +1 more source
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases [PDF]
, 2008 This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations
A. Cobham +15 more
core +7 more sources
Search Heuristics and Constructive Algorithms for Maximally Idempotent Integers
Information, 2021 Previous work established the set of square-free integers n with at least one factorization n=p¯q¯ for which p¯ and q¯ are valid RSA keys, whether they are prime or composite.
Barry Fagin
doaj +1 more source
International Journal of Adaptive Control and Signal Processing, EarlyView.Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez +2 more
wiley +1 more source