نتایج جستجو برای: random key representation

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

Journal: :international journal of supply and operations management 2015
mohammad hassan sebt mohammad reza afshar yagub alipouri

in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهرکرد - دانشکده ادبیات و زبانهای خارجی 1392

the application of a comprehensive model of communicative language ability (cla) to language teaching and testing has always been an imperative in l2 education since hymess proposal of communicative competence in the 1970s. recent l2 research has clearly underscored the importance of sufficient pragmatics representation as an essential component of cla in pedagogical and testing practices in l2...

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

2010
Deming Lei

This paper addresses job shop scheduling problems with fuzzy processing time and fuzzy trapezoid or doublet due date. An efficient random key genetic algorithm (RKGA) is suggested to maximize the minimum agreement index and to minimize the maximum fuzzy completion time. In RKGA, a random key representation and a new decoding strategy are proposed and two-point crossover (TPX) and discrete cross...

2013
B. Santhana Krishnan Ayalvadi Ganesh D. Manjunath

Abstract—In a random key graph (RKG) of n nodes each node is randomly assigned a key ring of Kn cryptographic keys from a pool of Pn keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume that the n nodes are distributed uniformly in [0, 1]. In addition to the common key requirement, we require two nodes to also be within rn of each other to ...

Journal: :journal of communication engineering 0
mohammad ehdaie parsa sharif research center nikolaos alexiou kth panos papadimitratos kth

sybil attacks pose a serious threat for wireless sensor networks (wsn) security. they can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. in a sybil attack,the attacker masquerades as multiple sensor identities, that are actually controlled by one or a few existing attacker nodes. sybil identities are fabricated out of stolen keys, obt...

2001
Apostol Natsev Yuan-Chi Chang John R. Smith Chung-Sheng Li Jeffrey Scott Vitter

This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. This problem arises in many important applications dealing with ordered inputs and multiple ranked data sets, and requiring the top k solutions. We use multimedia applications as the motivating examples but the problem ...

Mahmoud Ahmadian Mohammad Ehdaie, Mohammad Reza Aref Nikos Alexiou Panos Papadimitratos,

Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...

Journal: :Nagoya Mathematical Journal 1987

Farzaneh Akbarzadeh Maliheh Khatami,

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

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

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