Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Bader F. AlBdaiwi"'
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2004, Iss 25, Pp 1299-1308 (2004)
Externí odkaz:
https://doaj.org/article/deb914d2357e4f258f294671df058789
Message broadcasting in networks can be efficiently carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at the same node r . Second, for every node
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c4f20e31adbb6aea4bb0be52afb97e7
http://arxiv.org/abs/1701.02991
http://arxiv.org/abs/1701.02991
The p-median problem is a well-known NP-hard problem. Many heuristics have been proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel computing platform to present a new genetic algorithm implemented in Cuda and base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b5355e47f6f852fac91473afe7ac1c7
http://arxiv.org/abs/1610.10061
http://arxiv.org/abs/1610.10061
Autor:
Bader F. AlBdaiwi
There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in hamiltonian 3-conne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c6901bea6a36c0a4a6ea5b2b9406396
http://arxiv.org/abs/1603.01807
http://arxiv.org/abs/1603.01807
Autor:
Bader F. AlBdaiwi, Peter Horak
Publikováno v:
IEEE Transactions on Information Theory. 58:5490-5499
Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-correcting Lee codes. In this paper we deal with the existence and enumera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b41f917a40db10b34d851f20442c111d
https://doi.org/10.1109/tit.2012.2196257
https://doi.org/10.1109/tit.2012.2196257
Publikováno v:
The Computer Journal. 55:578-589
Many fundamental problems in the area of distributed systems such as security, reliable routing, network survivability and broadening available bandwidth can be addressed through the use of disjoint paths between communication endpoints. Therefore, d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd25ee9ed8fd82fda8b803603ac368b8
https://doi.org/10.1093/comjnl/bxr095
https://doi.org/10.1093/comjnl/bxr095
Autor:
Bader F. AlBdaiwi, Peter Horak
Publikováno v:
Discrete & Computational Geometry. 47:1-16
An n-dimensional cross consists of 2n+1 unit cubes: the “central” cube and reflections in all its faces. A tiling by crosses is called a Z-tiling if each cross is centered at a point with integer coordinates. Periodic tilings of ℝ n by crosses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d2cd46edfa8a35e25afa93e2c0f3fb3
https://doi.org/10.1007/s00454-011-9373-5
https://doi.org/10.1007/s00454-011-9373-5
Publikováno v:
IEEE Transactions on Computers. 59:995-999
The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t ? s. Two paths from s to t are said to be node-disjoint iff they do not have any common vertices except for their endpoints. Distrib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d30b1a844c053340b2e8ab40557c435a
https://doi.org/10.1109/tc.2010.76
https://doi.org/10.1109/tc.2010.76
Publikováno v:
Computers & Mathematics with Applications, 57(5), 812-820. PERGAMON-ELSEVIER SCIENCE LTD
In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has the same goal function value in all such instances.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fd32929829d506f6ddf3bf373b0d53a
https://doi.org/10.1016/j.camwa.2008.10.081
https://doi.org/10.1016/j.camwa.2008.10.081
Publikováno v:
IEEE Transactions on Computers. 56:1297-1307
Gray codes, where two consecutive codewords differ in exactly one position by plusmn1, are given. In a single-radix code, all dimensions have the same base, say, kappa, whereas, in a mixed-radix code, the base in one dimension can be different from t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54f80ba4c83d67bc684a065dfcacec4e
https://doi.org/10.1109/tc.2007.1083
https://doi.org/10.1109/tc.2007.1083