Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Sutep Tongngam"'
Autor:
Pranomkorn Ampornphan, Sutep Tongngam
Publikováno v:
Information, Vol 11, Iss 6, p 333 (2020)
A patent is an important document issued by the government to protect inventions or product design. Inventions consist of mechanical structures, production processes, quality improvements of products, and so on. Generally, goods or appliances in ever
Externí odkaz:
https://doaj.org/article/f6ca291edbc7439ebf22b621afb3685b
Autor:
Sutep Tongngam, Pranomkorn Ampornphan
Publikováno v:
Information
Volume 11
Issue 6
Information, Vol 11, Iss 333, p 333 (2020)
Volume 11
Issue 6
Information, Vol 11, Iss 333, p 333 (2020)
A patent is an important document issued by the government to protect inventions or product design. Inventions consist of mechanical structures, production processes, quality improvements of products, and so on. Generally, goods or appliances in ever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::673a433bdfb11daae7dafd0a4f8a38df
Autor:
Pranomkorn Ampornphan, Sutep Tongngam
Publikováno v:
Proceedings of the 2017 International Conference on Information Technology.
Patents are a form of intellectual property that is close to most everyone. Generally, goods or appliance in everyday life are the inventions that provide the solutions to improve a specific technological problem or production process. The invention
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13bc1f3c78ca97425e1264c8abe73832
https://doi.org/10.1145/3176653.3176721
https://doi.org/10.1145/3176653.3176721
Autor:
Sutep Tongngam
Publikováno v:
2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN).
In the minimum latency broadcasting problem with interference in concern, some previously proposed heuristics where broadcasting nodes with an ability to reduce their transmission range to their farthest nodes have shown an improvement in decreasing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f250e23a354724462763fa2427654eb
https://doi.org/10.1109/iccsn.2017.8230138
https://doi.org/10.1109/iccsn.2017.8230138
Autor:
Gruia Calinescu, Guoliang Xue, Benjamin Grimmer, Sutep Tongngam, Satyajayant Misra, Weiyi Zhang
Publikováno v:
Journal of Combinatorial Optimization. 31:1280-1297
We consider the problem of Single-Tiered Relay Placement with Basestations, which takes as input a set $$S$$S of sensors and a set $$B$$B of basestations described as points in a normed space $$(M,d)$$(M,d), and real numbers $$0< r\le R$$0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a28915124f4350596c0a6c184b10ee0
https://doi.org/10.1007/s10878-014-9823-0
https://doi.org/10.1007/s10878-014-9823-0
Autor:
Alexander Fortin, Nandakiran Kirubanandan, Tricha Anjali, Sanjiv Kapoor, Gruia Calinescu, Sutep Tongngam
Publikováno v:
INFOCOM
In this paper we address the issue of designing multi-path routing algorithms. Multi-path routing has the potential of improving the throughput but requires buffers at the destination. Our model assumes a network with capacitated edges and a delay fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e523a755e4be072e2efb1f08f33d1c48
https://doi.org/10.1109/infcom.2010.5462102
https://doi.org/10.1109/infcom.2010.5462102
Autor:
Gruia Calinescu, Sutep Tongngam
Publikováno v:
MSN
In this paper, we study the interference-aware broadcast scheduling problem, where all nodes in the Euclidean plane have a transmission range and an interference range equal to r and alphar for alphages1, respectively. Minimizing latency is known to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d08e0311ff8d4243b22b3c53236f436
https://doi.org/10.1109/msn.2008.37
https://doi.org/10.1109/msn.2008.37
Autor:
Gruia Calinescu, Sutep Tongngam
Publikováno v:
Wireless Algorithms, Systems, and Applications ISBN: 9783540885818
WASA
WASA
Motivated by application to wireless sensor networks, we study the following problem. We are given a set Sof wireless sensor nodes, given as a set of points in the two-dimensional plane, and real numbers 0 < r≤ R. We must place a minimum-size set Q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::956a645e057d2e0320c7619fb8bbacc2
https://doi.org/10.1007/978-3-540-88582-5_28
https://doi.org/10.1007/978-3-540-88582-5_28
Autor:
Sutep Tongngam, Jeffrey Stanford
Publikováno v:
SNPD
We consider the problem of maximising the lifetime of sensor networks with data aggregation, which was previously investigated by Kalpakis et al. (2003). They propose an exact polynomial-time algorithm, which is however very slow, and faster heuristi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6b579efaec51606efeea17aa6310a20
https://doi.org/10.1504/ijsnet.2009.028024
https://doi.org/10.1504/ijsnet.2009.028024
Publikováno v:
2015 International Conference on Control, Automation & Robotics; 2015, px-xi, 2p