نتایج جستجو برای: greedy forwarding

تعداد نتایج: 19989  

Journal: :journal of algorithms and computation 0
s. jabari university of tehran, department of algorithms and computation. dara moazzami university of tehran, college of engineering, faculty of engineering science a. ghodousian university of tehran, college of engineering, faculty of engineering science

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

Journal: :Journal of Mathematical Analysis and Applications 2023

The goal of this paper is to study the performance Thresholding Greedy Algorithm (TGA) when we increase size greedy sums by a constant factor λ⩾1. We introduce so-called λ-almost and λ-partially bases. case λ=1 gives us classical definitions almost (strong) partially show that basis if only it for all (some) However, each λ>1, there exists an unconditional but not 1-partially greedy. Furthermor...

2005
KE LIU Nael Abu-Ghazaleh Kyoung-Don Kang

Wireless sensor networks have been attracting significant research and commercial interest recently. In many sensor network applications, such as real-time surveillance and monitoring, the sensed data need to be delivered with some real-time constraints, such as an end-to-end deadlines. Since the data dissemination model is different from the tranditional wireless ad hoc networks or any central...

2009
Roland Flury

The routing of messages is one of the basic operations any computer network needs to provide. In this thesis, we consider wireless ad hoc and sensor networks and present several routing protocols that are tailored to the limited hardware capabilities of network participants such as sensor nodes. The constraint memory and computing power as well as the limited energy of such devices requires sim...

Journal: :International Journal of Foundations of Computer Science 2018

Journal: :International Journal of Social Science 2023

This study aims to find out how forecast and predict the number of sales freight forwarding services at PT Samudera Naga Global. research was conducted using autoregression exponential smoothing methods. The author conducts on companies engaged in transportation goods that manage all or part activities related delivery receipt through routes. results were carried two methods, namely by comparin...

Journal: :CoRR 2010
Ochirkhand Erdene-Ochir Marine Minier Fabrice Valois Apostolos A. Kountouris

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In th...

Journal: :Combinatorics, Probability and Computing 2013

Journal: :Applied and Computational Harmonic Analysis 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید