Results 21 to 30 of about 42,595 (245)

A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Analysis of ...
Reinhard Kutzelnigg
doaj   +1 more source

Proximity Effect Aware Detailed Placement in Electron Beam Lithography

open access: yesMATEC Web of Conferences, 2018
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

open access: yesIEEE Access, 2018
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]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
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

open access: yesEPJ Web of Conferences, 2014
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 the existence of independent (1,k)-dominating sets for k\in\{1,2\} in two products of graphs [PDF]

open access: yesOpuscula Mathematica
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]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Graphs and ...
Tınaz Ekim   +2 more
doaj   +1 more source

Regularity of nonlinear generalized functions: A counterexample in the nonstandard setting

open access: yesExamples and Counterexamples, 2021
Regularity theory in generalized function algebras of Colombeau type is largely based on the notion of G∞-regularity, which reduces to C∞-regularity when restricted to Schwartz distributions.
H. Vernaeve
doaj   +1 more source

Sparse Group Feature Selection by Weighted Thresholding Homotopy Method

open access: yesIEEE Access, 2020
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

Investigating transcription factor dynamics in health and disease using FRAP

open access: yesFEBS Letters, EarlyView.
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy