Results 51 to 60 of about 719,735 (175)
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
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
0-1 Integer Linear Programming with a Linear Number of Constraints [PDF]
, 2014 We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor.
Impagliazzo, Russell +3 more
core +1 more source
Lecture Notes in Computer Science, 2014 Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of hypergraphs. Our main
J. Díaz, Ivan Lanese, Davide Sangiorgi
semanticscholar +1 more source
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
Open k-monopolies in graphs: complexity and related concepts [PDF]
, 2016 Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis ...
Kuziak, Dorota +2 more
core +3 more sources
, 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
Discounted-Sum Automata with Multiple Discount Factors [PDF]
Logical Methods in Computer ScienceDiscounting the influence of future events is a key paradigm in economics and it is widely used in computer-science models, such as games, Markov decision processes (MDPs), reinforcement learning, and automata.
Udi Boker, Guy Hefetz
doaj +1 more source
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
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