Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Zhivko Nedev"'
Autor:
Ernest Gomolemo Modise, Adamu Murtala Zungeru, Joseph M Chuma, S.R.S. Prabaharan, Bokani Mtengi, Albert Ude, Zhivko Nedev
Publikováno v:
IEEE Photonics Journal, Vol 13, Iss 3, Pp 1-24 (2021)
Modern-day diamond sorting is achieved through the application of X-ray luminescence (XRL) and X-ray transmission (XRT) techniques. Sorting with XRL is limited to the class range of 1.25 mm to 32 mm because of self-absorption associated with larger d
Externí odkaz:
https://doaj.org/article/20a726ed418b4ae6bc96ce1577d1f204
Autor:
Zhivko Nedev
Publikováno v:
Algorithms, Vol 3, Iss 3, Pp 244-254 (2010)
We analyze further the Magnus-Derek game, a two-player game played on a round table with n positions. The players jointly control the movement of a token. One player, Magnus, aims to maximize the number of positions visited while minimizing the numbe
Externí odkaz:
https://doaj.org/article/a6ef3920670c4ebbb083df49ff8b91c8
Autor:
Adamu Murtala Zungeru, Zhivko Nedev, Joseph Chuma, S.R.S. Prabaharan, Albert U. Ude, Bokani Mtengi, Ernest Gomolemo Modise
Publikováno v:
IEEE Photonics Journal, Vol 13, Iss 3, Pp 1-24 (2021)
Modern-day diamond sorting is achieved through the application of X-ray luminescence (XRL) and X-ray transmission (XRT) techniques. Sorting with XRL is limited to the class range of 1.25 mm to 32 mm because of self-absorption associated with larger d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::928fafe1c3dd68c456ef09ac85e26c70
https://doi.org/10.1109/jphot.2021.3074238
https://doi.org/10.1109/jphot.2021.3074238
Publikováno v:
Journal of Computer Science. 16:1319-1324
We describe a way to transfer efficiently Sudoku grids through the Internet. This is done by using linearization together with compression and decompression that use the information structure present in all sudoku grids. The compression and the corre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7d77a792dd219fcfa41cec7ba0c09c7
https://doi.org/10.3844/jcssp.2020.1319.1324
https://doi.org/10.3844/jcssp.2020.1319.1324
Autor:
Zhivko Nedev
Publikováno v:
International Mathematical Forum. 9:325-333
We analyze the Magnus-Derek game, a two-player game played on a round table having n positions. The players jointly control the movement of a token. One player aims to minimize the number of positions visited, and the other aims to maximize this quan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9a2ded056f96882db00726764f5740d
https://doi.org/10.12988/imf.2014.411
https://doi.org/10.12988/imf.2014.411
Autor:
Zhivko Nedev
Publikováno v:
Theoretical Computer Science. 460:89-93
We deal with small size balanced subsets of Z"p when p is prime. In a balanced set S, each element x@?S is a midpoint between two other elements from S, i.e. 2x=y+z(modp), y,z@?S@?{x}. We denote the minimum cardinality of a balanced set modulo p by @
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c71ba6752e0d374c1248121bd19cf8cb