Discrete and Continuous: A Fundamental Dichotomy in Mathematics [PDF]
The distinction between the discrete and the continuous lies at the heart of mathematics. Discrete mathematics (arithmetic, algebra, combinatorics, graph theory, cryptography, logic) has a set of concepts, techniques, and application areas largely ...
Franklin, James +2 more
core +1 more source
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]
Analysis of ...
Reinhard Kutzelnigg
doaj +1 more source
Proximity Effect Aware Detailed Placement in Electron Beam Lithography
Proximity effect is one of the most tremendous consequences that produces unacceptable exposures during electron beam lithography (EBL), and thus distorting the layout pattern. In this paper, we propose the first work which considers the proximity effect
Chen Yuhang +4 more
doaj +1 more source
An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing Problem
The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used ...
Zhen Chen, Jianli Chen
doaj +1 more source
Bipartite Random Graphs and Cuckoo Hashing [PDF]
The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise.
Reinhard Kutzelnigg
doaj +1 more source
Storage sizing for embedding of local gas production in a micro gas grid
In this paper we study the optimal control of a micro grid of biogas producers. The paper considers the possibility to have a local storage device for each producer, who partly consumes his own production, i.e. prosumer.
Alkano D. +3 more
doaj +1 more source
On zero-free intervals in (1, 2) of chromatic polynomials of some families of graphs
10.1137/070698294SIAM Journal on Discrete Mathematics242370 ...
Koh, Khee Meng +5 more
core +1 more source
On the existence of independent (1,k)-dominating sets for k\in\{1,2\} in two products of graphs [PDF]
A subset \(J\) of vertices is said to be a \((1,k)\)-dominating set if every vertex \(v\) not belonging to the set \(J\) has a neighbour in \(J\) and there exists also another vertex in \(J\) within the distance at most \(k\) from \(v\).
Paweł Bednarz +2 more
doaj +1 more source
Split-critical and uniquely split-colorable graphs [PDF]
Graphs and ...
Tınaz Ekim +2 more
doaj +1 more source
Sparse Group Feature Selection by Weighted Thresholding Homotopy Method
In this paper, we investigate the sparse group feature selection problem, in which covariates posses a grouping structure sparsity at the level of both features and groups simultaneously.
Jinglan Wu, Huating Huang, Wenxing Zhu
doaj +1 more source

