Results 1 to 10 of about 359,135 (290)
Efficient enumeration of solutions produced by closure operations [PDF]
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by polymorphisms ...
Arnaud Mary, Yann Strozecki
doaj +1 more source
An Enumerative Perspective on Connectivity [PDF]
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be the maximum ...
Shyan Akmal
doaj +1 more source
We investigate the interdisciplinarity of mathematics based on an analysis of projects sponsored by the NSFC (National Natural Science Foundation of China).
Zhi-Yi Shao +4 more
doaj +1 more source
METHODICAL ASPECTS OF SYSTEM MAXIMA IN LEARNING PROCESS OF OPERATIONS RESEARCH
Training of operations research of bachelors of Computer Science is particularly important because combines both fundamental concepts and principles of mathematics and informational different disciplines and applied models and algorithms for their use ...
Taras Kobylnyk, Ulyana Kogut
doaj
Spectral Independence via Stability and Applications to Holant-Type Problems [PDF]
This paper formalizes connections between stability of polynomials and convergence rates of Markov Chain Monte Carlo (MCMC) algorithms. We prove that if a (multivariate) partition function is nonzero in a region around a real point $\lambda$ then ...
Zongchen Chen, Kuikui Liu, Eric Vigoda
doaj +1 more source
Journal of Kufa for Mathematics and Computer
Journal of Kufa for Mathematics and ...
Journal of Kufa for Mathematics and Comp Journal of Kufa for Mathematics and Computer
doaj +2 more sources
Algorithms and the Mathematical Foundations of Computer Science [PDF]
The goal of this chapter is to bring to the attention of philosophers of mathematics the concept of algorithm as it is studied incontemporary theoretical computer science, and at the same time address several foundational questions about the role this notion plays in our practices.
openaire +1 more source
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem [PDF]
Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely.
Simon Hengeveld, Tillmann Miltzow
doaj +1 more source
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
Mathematics, Computer Science, Software Engineering
AbstractIn this talk I want to examine three ideas: First, the traditional relationship between a science, the mathematics it uses, and the engineering for which it is the basis. Second, the role of mathematics in the practice of software engineering, which is sometimes called “formal methods.” And finally, the role of theory in computer science, and ...
openaire +2 more sources

