Learn More
TRAVELING SALESMAN PROBLEM G.ANDAL JAYALAKSHMI Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India Email: andal_m@yahoo.com S.SATHIAMOORTHY Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India Email: s.sathiamoorthy@sify.com and R.RAJARAM Information(More)
This paper presents an automatic Facet Generation Framework (AFGF) for an efficient document retrieval. Facet generation is the task of automatically discovering facets of documents from text descriptions. In this paper, we propose a new approach which is both unsupervised and domain independent to extract the facets. We also discover an efficiency(More)
709 Abstract—The multi hop packet radio networks also named mobile ad-hoc networks (MANETs) have a dynamic topology due to the mobility of their nodes. A notable amount of energy is utilized every time a signal is sent and received by a mobile node. Many such signals and power are wasted to update the positional information of the nodes in a wireless(More)
The number of users and the amount of information available has exploded since the advent of the World Wide Web (WWW). Most of Web users use various search engines to get specific information. A key factor in the success of Web search engines are their ability to rapidly find good quality results to the queries that are based on specific terms. This paper(More)
The World Wide Web is growing rapidly and the Internet users are still increasing day by day. Increasing with the number of users, the need for automatic classification techniques with good classification accuracy increases as search engines depend on previously classified web pages stored as classified directories to retrieve the relevant results. Machine(More)
A Mobile Ad Hoc Network (MANET) is a collection of two or more mobile devices (e.g. PDAs, laptop, cell phones, etc.) with multi-hop wireless communication. Clustering has evolved as an important research topic in MANETs as it improves the system performance of large MANETs. Due to the dynamic nature of the mobile nodes, their association and disassociation(More)
The task scheduling problem in a heterogeneous system (TSPHS) is a NP-complete problem. It is a multiobjective optimization problem (MOP).The objectives such as makespan, average flow time, robustness and reliability of the schedule are considered for solving task scheduling problem. This paper considers three objectives of minimizing the makespan (schedule(More)