BITS Pilani Institutional Repository: Search

Search

Search:
for

Current filters:

Start a new search

Add filters:

Results/Page | Sort items by In order Authors/record

Results 21-30 of 32 (Search time: 0.003 seconds).

previous
1
2
3
4
next

Item hits:

Issue Date	Title	Author(s)
2012	Learning to Write Programs with Others: Collaborative Quadruple Programming	Arora, Ritu
2012-09	Collaboration in software development: a spotlight	Arora, Ritu
2012-10	Scheduling Algorithm for Asymmetric Multicore Platforms using Non-uniform Laxity based Clustering and Duplication	K., Pradheep Kumar
2012	Program Test Data Generation for branch coverage with genetic algorithm: comparative evaluation of a maximization and minimization approach” in First International workshop on Software Engineering and Applications	Pachauri, A.
2012-01	Comparative Evaluation of A Maximization And Minimization Approach for Test Data Generation with Genetic Algorithm and Binary Particle Swarm Optimization	Pachauri, A.
2012	ANALYSIS OF WATERMARKING TECHNIQUES FOR MEDICAL IMAGES PRESERVING ROI	Rathi, Sonika C.
2012	Use of Clonal Selection Algorithm as Software Test Data Generation Technique	Pachauri, A.
2012-08	MEDICAL IMAGES AUTHENTICATION THROUGH WATERMARKING PRESERVING ROI	Rathi, Sonika C.
2012	Enriching An Academic knowledge base using Linked Open Data	Gavankar, Chetana
2012-12	Energy efficient voltage scheduling for multi-core processors is an important issue in the context of parallel and distributed computing. Dynamic voltage scaling (DVS) is used to reduce the energy consumption of cores. Nowadays processor vendors are providing software for DVS. We consider a system using a single multi-core processor with software controlled DVS having a finite set of discretely available core speeds. Our contribution to this work is solving a well-known energy efficient voltage scheduling problem on the considered system. The problem that we consider is to find a minimum energy voltage scheduling for a given computational load that has to be completed within a given deadline. First we show that the existing methods to solve this problem on other processor models fail to apply on our processor model. Then we formulate an Integer Program (IP) for the problem.	Mishra, Abhishek