Using multiagents in reconfigurable hardware can solve complex problems quickly. This new paradigm has the potential to greatly increase computational systems' flexibility efficiency and expandability and provides an attractive alternative to current agent-based approaches.
Gravitational search algorithms (GSAs) yield high performances in solving optimization problems, but require time-consuming computations for the total force on each mass which makes the speed of optimization very low. However, replacing a GSA's sequential approach with a multiagent system could improve a GSA's speed considerably while maintaining the high… (More)
In this research we have proposed a new self-developed symmetric algorithm called FJ RC-4, which is derived from RC4. Our studies shown that KSA is the vulnerable stage of RC4, whereas a new self-developed symmetric algorithm, FJ-RC4, is an attempt to increase the security of RC4 by introducing the new algorithm for the KSA stage. We have investigated and… (More)
Feature selection is a problem of finding efficient features among all features in which the final feature set can improve accuracy and reduce complexity. In feature selection algorithms search strategies are key aspects. Since feature selection is an NP-Hard problem; therefore heuristic algorithms have been studied to solve this problem. In this paper, we… (More)
Sensor Networks have great potential for many applications. In time-critical and security applications, it is important to have on time delivery, minimum access time and maximum data rate. Most of sensor networks have a large number of sensor nodes which considering the memory and processor of each of them all together they provide a huge data storage space… (More)