نتایج جستجو برای: distance from communication paths
تعداد نتایج: 5937778 فیلتر نتایج به سال:
Wearable communication networks are a new type of networks where communication wires are embedded into textiles. It allows the connection between sensors and devices embedded into the material. Data from such devices can be sent over various pieces of clothing to other devices in the network. A special characteristic of such a network is the unreliable connection between different pieces of clo...
Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way of obtaining great performance, it may not always be so. When using such a cluster for executing a parallel application, performance may not be as good as expected due to delays in communication. Also, the heterogeneit...
Protein structure networks are constructed for the identification of long-range signaling pathways in cysteinyl tRNA synthetase (CysRS). Molecular dynamics simulation trajectory of CysRS-ligand complexes were used to determine conformational ensembles in order to gain insight into the allosteric signaling paths. Communication paths between the anticodon binding region and the aminoacylation reg...
This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a complete K-ary linking pin structure where every pair of siblings in a complete K-ary tree is adjacent. For a model of adding an edge between the root and a n...
This paper describes AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Ant Colony Optimization framework. In AntHocNet a source node reactively sets up a path to a destination node at the start of each communication session. During the course of the session, the source node uses ant agents to proactively search for alternatives and improvements of the origina...
This paper describes AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Ant Colony Optimization framework. In AntHocNet a source node reactively sets up a path to a destination node at the start of each communication session. During the course of the session, the source node uses ant agents to proactively search for alternatives and improvements of the origina...
We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set of k edge-disjoint paths (a structure we call a k-system) where k is a parameter determined by the connectivity of the network. This structure is resilient to adversaries with bounded eavesdropping capability. To...
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
Network-on-chip (NoC) has rapidly become a promising alternative for complex system-on-chip architectures including recent multicore architectures. Additionally, optimizing NoC architectures with respect to different design objectives that are suitable for a particular application domain is crucial for achieving high-performance and energy-efficient customized solutions. Despite the fact that m...
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of similarity search in standard graphs, a fundamental problem for probabilistic graphs is to efficiently answer k-nearest neighbor queries (k-NN), which is the problem of computing the k closest nodes to some specific node....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید