Results 1 to 10 of about 126,881 (168)
Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties
Mathematics, 2023 In the paper, we consider a generalization of the classical assignment problem, which is called the constrained assignment problem with bounds and penalties (CA-BP).
Guojun Hu, Junran Lichen, Pengxiang Pan
doaj +1 more source
GE vs GM: Efficient side-channel security evaluations on full cryptographic keys
Transactions on Cryptographic Hardware and Embedded Systems, 2022 Security evaluations for full cryptographic keys is a very important research topic since the past decade. An efficient rank estimation algorithm was proposed at FSE 2015 to approximate the empirical guessing entropy remaining after a side-channel ...
Anca Rădulescu +2 more
doaj +3 more sources
An Improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
Mathematics, 2021 For a graph G, its k-rainbow independent domination number, written as γrik(G), is defined as the cardinality of a minimum set consisting of k vertex-disjoint independent sets V1,V2,…,Vk such that every vertex in V0=V(G)\(∪i=1kVi) has a neighbor in Vi ...
Enqiang Zhu
doaj +1 more source
Blockwise and Low Density Key Error Correcting Codes [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2020 To protect the information from disturbances created by noisy channels, redundant symbols (called check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system.
Pankaj Kumar Das, Subodh Kumar
doaj +1 more source
BOUNDED AND FULLY BOUNDED MODULES [PDF]
Bulletin of the Australian Mathematical Society, 2011 AbstractGeneralizing the concept of right bounded rings, a module MR is called bounded if annR(M/N)≤eRR for all N≤eMR. The module MR is called fully bounded if (M/P) is bounded as a module over R/annR(M/P) for any ℒ2-prime submodule P◃MR. Boundedness and right boundedness are Morita invariant properties.
Haghany, A., Mazrooei, M., Vedadi, M. R.
openaire +2 more sources
Minimizing Error Bounds in Lacunary Interpolation by Spline (0, 2) Case [PDF]
Kirkuk Journal of Science, 2009 In this paper, we have changed the boundary conditions and the class of spline functions which are given by (Varma, (1973) from first derivative to third derivative, and show that the change of the boundary conditions and the class of spline functions ...
Karwan H. Jwamer Faridun Kader Hama Salih
doaj +1 more source
Bounded underapproximations [PDF]
Formal Methods in System Design, 2010 We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L' included in L which has the same Parikh (commutative) image as L. Bounded languages, introduced by Ginsburg and Spanier, are subsets of regular languages of the form w1*w2*...wk* for some finite
Ganty, Pierre +2 more
openaire +6 more sources
Theoretical Computer Science, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Cheng Chan, David +2 more
openaire +4 more sources
Bounds on Malapportionment [PDF]
Operations Research Letters, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
László Á. Kóczy, Balázs R. Sziklai
openaire +2 more sources
Entropy, 2020 In this paper, we derive lower and upper bounds on the OPTA of a two-user multi-input multi-output (MIMO) causal encoding and causal decoding problem.
Photios A. Stavrou +2 more
doaj +1 more source