Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Cem Evrendilek"'
Autor:
Cem Evrendilek
Publikováno v:
Sensors, Vol 8, Iss 2, Pp 635-657 (2008)
Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputatio
Externí odkaz:
https://doaj.org/article/eb57e2bdac5e4ae4820b3f91e3e2ae8a
Publikováno v:
Journal of Heuristics. 24:617-644
Given an edge weighted tree T(V, E), rooted at a designated base vertex $$r \in V$$ , and a color from a set of colors $$C=\{1,\ldots ,k\}$$ assigned to every vertex $$v \in V$$ , All Colors Shortest Path problem on trees (ACSP-t) seeks the shortest,
Autor:
Hüseyin Akcan, Cem Evrendilek
Localization is an essential service in wireless sensor networks. Trilateration is a commonly used solution to range-based localization for providing such services. It might be, however, impossible to localize the entire network at once using trilate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fcee3ff1709bab2ce511678927af120
https://aperta.ulakbim.gov.tr/record/33525
https://aperta.ulakbim.gov.tr/record/33525
Publikováno v:
Discrete Applied Mathematics. 164:92-99
We address the problem of covering points with orthogonal polygons. Specifically, given a set of n points in the plane, we investigate the existence of an orthogonal polygon such that there is a one-to-one correspondence between the points and the ed
Autor:
Hüseyin Akcan, Cem Evrendilek
Publikováno v:
Computer Communications. 35:1151-1163
Location discovery, especially in mobile environments, has recently become the key component of many applications. Accurate location discovery, particularly in safety critical applications using autonomous robots or unmanned vehicles, however, is sti
Publikováno v:
Computational Geometry. 44:249-264
In this paper, we address the problem of covering points with orthogonally convex polygons. In particular, given a point set of size n on the plane, we aim at finding if there exists an orthogonally convex polygon such that each edge of the polygon c
Publikováno v:
Electronic Notes in Discrete Mathematics. 36:303-310
We address the problem of covering points with orthogonal polygons. Specifically, given a set of n grid-points in the plane each designated in advance with either a horizontal or vertical reading, we investigate the existence of an orthogonal polygon
Autor:
Hüseyin Akcan, Cem Evrendilek
Publikováno v:
IEEE Communications Letters. 15:1097-1099
Recent developments, especially in wireless and mobile networks, have enabled the use of location based services in many application areas. Accurate location discovery, however, is still an open problem. A widely used and practical localization metho
Many large organizations, such as corporations, are hierarchical by nature. In hierarchical organizations, each entity, except the root, is a sub-part of another entity. In this paper, we study the task assignment problem to the entities of a tree-li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::192412cb2996ae498f92713aa5c372a1
http://arxiv.org/abs/1404.0783
http://arxiv.org/abs/1404.0783
The subject of this book is Command Control Communication and Information 3 (C I) which is the management infrastructure for any large or complex dynamic resource systems. Here command means the determination of what to do, and control means the ongo