Results 51 to 60 of about 939,183 (156)
A Danzer set for Axis Parallel Boxes [PDF]
, 2015 We present concrete constructions of discrete sets in $\mathbb{R}^d$ ($d\ge 2$) that intersect every aligned box of volume $1$ in $\mathbb{R}^d$, and which have optimal growth rate $O(T^d)$
Simmons, David, Solomon, Yaar
core +3 more sources
A new method for computing asymptotics of diagonal coefficients of multivariate generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Let $\sum_{\mathbf{n} \in \mathbb{N}^d} F_{\mathbf{n}} \mathbf{x}^{\mathbf{n}}$ be a multivariate generating function that converges in a neighborhood of the origin of $\mathbb{C}^d$. We present a new, multivariate method for computing the asymptotics of
Alexander Raichev, Mark C. Wilson
doaj +1 more source
An Analysis of Geometric Semantic Crossover: A Computational Geometry Approach
International Joint Conference on Computational Intelligence, 2016 Geometric semantic operators have recently shown their ability to outperform standard genetic operators on different complex real world problems. Nonetheless, they are affected by drawbacks. In this paper, we focus on one of these drawbacks, i.e.
M. Castelli +5 more
semanticscholar +1 more source
Enumerating Foldings and Unfoldings between Polygons and Polytopes [PDF]
, 2001 We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons.
Demaine, Erik D. +3 more
core +2 more sources
Edge-Unfolding Nearly Flat Convex Caps [PDF]
, 2018 The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron and a halfspace.
O\u27Rourke, Joseph
core +2 more sources
The average position of the first maximum in a sample of geometric random variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We consider samples of n geometric random variables $(Γ _1, Γ _2, \dots Γ _n)$ where $\mathbb{P}\{Γ _j=i\}=pq^{i-1}$, for $1≤j ≤n$, with $p+q=1$. The parameter we study is the position of the first occurrence of the maximum value in a such a sample.
Margaret Archibald, Arnold Knopfmacher
doaj +1 more source
Osculating Random Walks on Cylinders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before.
Saibal Mitra, Bernard Nienhuis
doaj +1 more source
Intrinsic universality and the computational power of self-assembly
, 2013 This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.
Woods, Damien
core +2 more sources
Approximating Persistent Homology in Euclidean Space Through Collapses [PDF]
, 2014 The \v{C}ech complex is one of the most widely used tools in applied algebraic topology. Unfortunately, due to the inclusive nature of the \v{C}ech filtration, the number of simplices grows exponentially in the number of input points.
Botnan, Magnus Bakke, Spreemann, Gard
core +1 more source
Average properties of combinatorial problems and thermodynamics of spin models on graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average.
Alessandro Vezzani +2 more
doaj +1 more source