NDLI: Extracting Knowledge to Predict TSP Asymptotic Time Complexity

Content Provider	IEEE Xplore Digital Library
Author	Fritzsche, P.C. Rexachs, D. Luque, E.
Copyright Year	2007
Description	Author affiliation: Univ. Autonoma of Barcelona, Barcelona (Fritzsche, P.C.; Rexachs, D.; Luque, E.)
Abstract	Computational science (CS) is often referred to as the third science, complementing both theoretical and laboratory science. In this field, new challenges are continuously arising. It allows doing things that were previously too difficult to do due to the complexity of the mathematics, the large number of calculations involved, or a combination of both. The asymptotic time complexity definition of both deterministic and non-deterministic algorithms to solve all kind of problems is one of the key points in computer science. Knowing the limit of the execution time of an algorithm when the size of the problem goes to infinity is essential. In particular, data-dependent applications is an extremely challenging problem because for a specific issue the input data sets may cause variability in execution times. The development of an entire approach to define the asymptotic time complexity of a hard data-dependent parallel application that solves the traveling salesman problem (TSP) is the focus of this study. This is a process designed to explore data in search of patterns and/or relationships, and then to predict performance order for new data sets by applying historical detected patterns. Two different parallel TSP algorithms are presented. One of these is used to show the usefulness and the profits of the proposed approach, and the other one is used as witness. The experimental results are quite promising.
Starting Page	309
Ending Page	318
File Size	570194
Page Count	10
File Format	PDF
ISBN	9780769530192
DOI	10.1109/ICDMW.2007.112
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Process design Laboratories Computer architecture H infinity control Traveling salesman problems Biology computing Mathematics Data mining Application software
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Applying Data Mining to Define TSP Asymptotic Time Complexity

TSP Performance Prediction Using Data Mining

A Computational Approach to TSP Performance Prediction Using Data Mining

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Study on a novel genetic algorithm for the combinatorial optimization problem

Computing the epistasis variance of large-scale traveling salesman problems

Extracting Dynamics from Static Cancer Expression Data

Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem

An Improved Particle Swarm Optimization Algorithm and Its Application for Solving Traveling Salesman Problem

Extracting Knowledge to Predict TSP Asymptotic Time Complexity

Similar Documents

Applying Data Mining to Define TSP Asymptotic Time Complexity

TSP Performance Prediction Using Data Mining

A Computational Approach to TSP Performance Prediction Using Data Mining

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Study on a novel genetic algorithm for the combinatorial optimization problem

Computing the epistasis variance of large-scale traveling salesman problems

Extracting Dynamics from Static Cancer Expression Data

Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem

An Improved Particle Swarm Optimization Algorithm and Its Application for Solving Traveling Salesman Problem

Extracting Knowledge to Predict TSP Asymptotic Time Complexity