Learn More
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. Our approach requires minimal problem specific information and no problem specific operators or repair mechanisms. Key features of our system include a flexible, adaptive problem representation and an incremental fitness function. Comparison(More)
Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between the quality of the solution and the computational complexity and scalability of the algorithm. Previous comparison studies have frequently operated with simplifying assumptions, such as(More)
Wireless Sensor Networks (WSNs) offer an excellent opportunity to monitor environments, and have a lot of interesting applications in warfare. The problem is that security mechanisms used for wired networks do not transfer directly to sensor networks. Some of this is due to the fact that there is not a person controlling each of the nodes, and even more(More)
In a pursuit-evasion (PE) game, each pursuer attempts to minimize the distance between the pursuer (P) and the evader (E) and capture it in the shortest time, whereas the evader tries to maximize the distance to escape from being captured. In this paper, we deal with PE games with a fast evader which can match the speed of or outrun the pursuers. We apply(More)
Wireless sensor networks are gaining lot of popularity because of its widespread applications. They consist of small sensor nodes that are low in battery and computational capability. Mostly these nodes are deployed in remote areas thus it's not easy to replace their batteries. In clustering process, clusters of the sensor nodes are formed. All the(More)
Wireless sensor networks are comprised of sensor nodes. Responsibility of the sensor nodes is to sense the atmospheric parameters and forward this data to cluster head. As the nodes are densely deployed, there is a possibility that the data is redundant. So in order to remove the redundancy, cluster head performs aggregation of the data and forward this(More)
We describe a novel GA approach to partition programs to be executed on a parallel system. Two unique features distinguish this GA from traditional GA programs. First, this GA uses a dynamically incremental t-ness function which starts out rewarding for simpler goals, gradually increasing the dii-culty of the desired tness values or goals until a full(More)
This paper introduces a divide-and-conquer, heuristic task scheduling optimization approach on the challenging multi-pursuer multi-evader (MPME) games in which pursuers attempt to minimize the time to capture all evaders whereas evaders try to maximize the capture time. The MPME task scheduling problem is solved through a two-step hierarchical approach. At(More)
  • 1