#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Genetic Algorithm is a search technique used in computing to find approximate solutions to optimization and search problems. As a search strategy, genetic algorithm has been applied successfully in many fields. Firstly, this paper describes the genetic algorithms evolution process .It then describes the active contours to detect the boundaries of the object… (More)

Travelling salesman problem (TSP) is a combinatorial optimization problem. It is NP hard problem and TSP is the most intensively studied problem in the area of optimization. There are a number of approximation algorithms and heuristics proposed in the literature which can yield to good solutions. But with the increase in the number of cities, the complexity… (More)

- Abdoun Otman, Shalini Singh, Poonam Panwar, Saloni Gupta
- 2014

Traveling salesman problem is quite known in the field of combinatorial optimization. Through this research describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. This research to find the most approximate solution that gives us the least distance, which is the shortest route for traverse the cities given in the… (More)

- Poonam Panwar, A. K. Lal, Jugminder Singh
- SocProS
- 2011

Both parallel and distributed network environment systems play a vital role in the improvement of high performance computing. The primary concern when analyzing these systems is multiprocessor task scheduling. This paper addresses the problem of efficient multiprocessor task scheduling. A multiprocessor task scheduling problem is represented as directed… (More)

Multiprocessor architectures are becoming more attractive for embedded systems, primarily because major processor manufacturers like Intel and AMD are designing cost effective processors even for personal computers and laptops. This makes such architectures very desirable for embedded system applications with high computational workloads, where additional,… (More)

Scheduling parallel tasks on multiprocessor systems is to allocate a set of tasks to processors such that the optimal usage of processors and accepted computation time for scheduling algorithm are obtained. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for… (More)

- Poonam Panwar, Ankur Garg
- 2013

It is always a very costly process to achieve a high level of reliability in software industry. So it is desirable for an industry to design software with minimum cost and optimal level of reliability. This paper addresses the problem of maximizing reliability of software by minimizing the overall cost of software. The technique deals with selecting various… (More)

- ‹
- 1
- ›