Some typical optimization problems like knapsack problem, activity selection problem, coin change... more Some typical optimization problems like knapsack problem, activity selection problem, coin change problem and subset sum problem are taught in different courses of theoretical computer science, or in the different modules of the same course. A few of these problems can be solved in polynomial time but the r est are NP-complete problems. Even though, every proble m has its own nature and description; however after changing certain constraints, they become equivalen t to each other. These problems are discussed independen tly in most textbooks which makes it harder for the students to interlink them. Students get confused very easil y while transitioning between different problem domains eve n if one problem is described in the language of another problem. In this paper, we have carefully analyzed and investigated links between the aforementioned probl ems and have also diagnosed the major causes of failure in understanding. One of the primary reasons students face difficulty is that ...
Abstract- Some typical optimization problems like knapsack problem, activity selection problem, c... more Abstract- Some typical optimization problems like knapsack problem, activity selection problem, coin change problem and subset sum problem are taught in different courses of theoretical computer science, or in the different modules of the same course. A few of these problems can be solved in polynomial time but the rest are NP-complete problems. Even though, every problem has its own nature and description; however after changing certain constraints, they become equivalent to each other. These problems are discussed independently in most textbooks which makes it harder for the students to interlink them. Students get confused very easily while transitioning between different problem domains even if one problem is described in the language of another problem. In this paper, we have carefully analyzed and investigated links between the aforementioned problems and have also diagnosed the major causes of failure in understanding. One of the primary reasons students face difficulty is th...
... Systems M. Ashraf Iqbal*, Saeed Iqbal Department of Electrical Engineering University of Engi... more ... Systems M. Ashraf Iqbal*, Saeed Iqbal Department of Electrical Engineering University of Engineering & Technology, Muhammad E. Shaaban Department of Electrical Engineering-Systems University of Sout hern California, Lahore, Pakistan Los Angeles Abstract ...
... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of M... more ... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of Management Sciences M. Ashraf Iqbal Lahore University of Management Sciences Yasser Hashmi Lahore University of Management Sciences ...
International Journal of Pedagogies and Learning, 2005
... Sciences, Pakistan (aiqbal@lums.edu.pk) Yasser Hashmi, Department of Social Sciences, Lahore ... more ... Sciences, Pakistan (aiqbal@lums.edu.pk) Yasser Hashmi, Department of Social Sciences, Lahore University of Management Sciences, Pakistan (yasser@lums.edu ... various fields at the tertiary level of education (Iqbal & Alvi, 2004; Iqbal & Hashmi, 2005; Iqbal & Tahir, 2003; Iqbal ...
Multimedia applications require intermediate processing between media sources and sinks. In addi-... more Multimedia applications require intermediate processing between media sources and sinks. In addi- tion to end-user machines intermediate computers can be used for performing media processing. This possi- bility leads to the problem of allocating processing components on various computers. In this paper, we study this problem in the context of star-shaped application graphs which have to be allocated between given end- user machines (satellites) and a central computer (host). The problem is formulated in terms of best achiev- able bottleneck resource usage. Several approaches are considered including an approximate scheme and two fast-heuristics. Performance measurements show the efficiency of the considered approaches. A discus- sion of our approach shows important differences to solutions provided for related problems of graph parti- tioning and mapping.
This paper presents an analysis of the problems faced while learning Inter-Domain transformations... more This paper presents an analysis of the problems faced while learning Inter-Domain transformations of problem solutions. Given the solution to a problem in one domain say Game Theory; one can slightly change it to solve a similar or even a completely different prob lem from another domain say Computational Biology. Our work focuses on a Grid Structure which is a
... Yasser Hashmi Lahore University of Management Sciences, Lahore-54792, Pakistan ... In Depth F... more ... Yasser Hashmi Lahore University of Management Sciences, Lahore-54792, Pakistan ... In Depth First Search (DFS) of a directed graph, edges are explored out of the mostly recently discovered vertex v that still has unexplored edges leaving it. ...
... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of M... more ... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of Management Sciences M. Ashraf Iqbal Lahore University of Management Sciences Yasser Hashmi Lahore University of Management Sciences ...
... Agent Migration Strategies Authors: Prof. M. Ashraf Iqbal Dipl.-Inform. Joachim Baumann Dipl.... more ... Agent Migration Strategies Authors: Prof. M. Ashraf Iqbal Dipl.-Inform. Joachim Baumann Dipl.-Inform. Markus Straßer Institut für Parallele und Verteilte Höchstleistungsrechner (IPVR) Fakultät Informatik Universität Stuttgart Breitwiesenstr. 20-22 D-70565 Stuttgart Germany ...
Some typical optimization problems like knapsack problem, activity selection problem, coin change... more Some typical optimization problems like knapsack problem, activity selection problem, coin change problem and subset sum problem are taught in different courses of theoretical computer science, or in the different modules of the same course. A few of these problems can be solved in polynomial time but the r est are NP-complete problems. Even though, every proble m has its own nature and description; however after changing certain constraints, they become equivalen t to each other. These problems are discussed independen tly in most textbooks which makes it harder for the students to interlink them. Students get confused very easil y while transitioning between different problem domains eve n if one problem is described in the language of another problem. In this paper, we have carefully analyzed and investigated links between the aforementioned probl ems and have also diagnosed the major causes of failure in understanding. One of the primary reasons students face difficulty is that ...
Abstract- Some typical optimization problems like knapsack problem, activity selection problem, c... more Abstract- Some typical optimization problems like knapsack problem, activity selection problem, coin change problem and subset sum problem are taught in different courses of theoretical computer science, or in the different modules of the same course. A few of these problems can be solved in polynomial time but the rest are NP-complete problems. Even though, every problem has its own nature and description; however after changing certain constraints, they become equivalent to each other. These problems are discussed independently in most textbooks which makes it harder for the students to interlink them. Students get confused very easily while transitioning between different problem domains even if one problem is described in the language of another problem. In this paper, we have carefully analyzed and investigated links between the aforementioned problems and have also diagnosed the major causes of failure in understanding. One of the primary reasons students face difficulty is th...
... Systems M. Ashraf Iqbal*, Saeed Iqbal Department of Electrical Engineering University of Engi... more ... Systems M. Ashraf Iqbal*, Saeed Iqbal Department of Electrical Engineering University of Engineering & Technology, Muhammad E. Shaaban Department of Electrical Engineering-Systems University of Sout hern California, Lahore, Pakistan Los Angeles Abstract ...
... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of M... more ... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of Management Sciences M. Ashraf Iqbal Lahore University of Management Sciences Yasser Hashmi Lahore University of Management Sciences ...
International Journal of Pedagogies and Learning, 2005
... Sciences, Pakistan (aiqbal@lums.edu.pk) Yasser Hashmi, Department of Social Sciences, Lahore ... more ... Sciences, Pakistan (aiqbal@lums.edu.pk) Yasser Hashmi, Department of Social Sciences, Lahore University of Management Sciences, Pakistan (yasser@lums.edu ... various fields at the tertiary level of education (Iqbal & Alvi, 2004; Iqbal & Hashmi, 2005; Iqbal & Tahir, 2003; Iqbal ...
Multimedia applications require intermediate processing between media sources and sinks. In addi-... more Multimedia applications require intermediate processing between media sources and sinks. In addi- tion to end-user machines intermediate computers can be used for performing media processing. This possi- bility leads to the problem of allocating processing components on various computers. In this paper, we study this problem in the context of star-shaped application graphs which have to be allocated between given end- user machines (satellites) and a central computer (host). The problem is formulated in terms of best achiev- able bottleneck resource usage. Several approaches are considered including an approximate scheme and two fast-heuristics. Performance measurements show the efficiency of the considered approaches. A discus- sion of our approach shows important differences to solutions provided for related problems of graph parti- tioning and mapping.
This paper presents an analysis of the problems faced while learning Inter-Domain transformations... more This paper presents an analysis of the problems faced while learning Inter-Domain transformations of problem solutions. Given the solution to a problem in one domain say Game Theory; one can slightly change it to solve a similar or even a completely different prob lem from another domain say Computational Biology. Our work focuses on a Grid Structure which is a
... Yasser Hashmi Lahore University of Management Sciences, Lahore-54792, Pakistan ... In Depth F... more ... Yasser Hashmi Lahore University of Management Sciences, Lahore-54792, Pakistan ... In Depth First Search (DFS) of a directed graph, edges are explored out of the mostly recently discovered vertex v that still has unexplored edges leaving it. ...
... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of M... more ... Maryam Mustafa Lahore University of Management Sciences Khurram Qadeer Lahore University of Management Sciences M. Ashraf Iqbal Lahore University of Management Sciences Yasser Hashmi Lahore University of Management Sciences ...
... Agent Migration Strategies Authors: Prof. M. Ashraf Iqbal Dipl.-Inform. Joachim Baumann Dipl.... more ... Agent Migration Strategies Authors: Prof. M. Ashraf Iqbal Dipl.-Inform. Joachim Baumann Dipl.-Inform. Markus Straßer Institut für Parallele und Verteilte Höchstleistungsrechner (IPVR) Fakultät Informatik Universität Stuttgart Breitwiesenstr. 20-22 D-70565 Stuttgart Germany ...
Uploads
Papers by Ashraf Iqbal