5 resultados para Lower Bounds
em Dalarna University College Electronic Archive
Resumo:
The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.
Resumo:
Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones.
Resumo:
Solutions to combinatorial optimization problems, such as problems of locating facilities, frequently rely on heuristics to minimize the objective function. The optimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. Pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small, almost dormant, branch of the literature suggests using statistical principles to estimate the minimum and its bounds as a tool to decide upon stopping and evaluating the quality of the solution. In this paper we examine the functioning of statistical bounds obtained from four different estimators by using simulated annealing on p-median test problems taken from Beasley’s OR-library. We find the Weibull estimator and the 2nd order Jackknife estimator preferable and the requirement of sample size to be about 10 being much less than the current recommendation. However, reliable statistical bounds are found to depend critically on a sample of heuristic solutions of high quality and we give a simple statistic useful for checking the quality. We end the paper with an illustration on using statistical bounds in a problem of locating some 70 distribution centers of the Swedish Post in one Swedish region.
Resumo:
The use of children’s literature in the English as a Second language (ESL) classroom is a widely used teaching method. This study aims to find research relating to the incorporation of children’s literature in the lower elementary English as a secondlanguage classroom. The main questions are how children’s literature can be used in the classroom and what potential benefits it has. A systematic literature review was carried out and research from six studies was included. The included studies, analyzed in this thesis, involved children aged 6-9, who are learning a second language. The results reveal multiple benefits with the use of children’s literature in the lower elementary ESL classroom, such as vocabulary gains, improved speaking and listening skills, increased motivation and better pronunciation. The results also present a few suggestions on how to incorporate the literature in the classroom, where reading aloud to the students appears to be the most common practice. It also appears common to have post-reading sessions that include discussions about what has been read.
Resumo:
Over 20,000 Swedish lower high school students are currently learning mathematics in English but little research has been conducted in this area. This study looks into the question of how much second language learner training teachers teaching mathematics in English to Swedish speaking students have acquired and how many of those teachers are using effective teaching practices for second language learners. The study confirms earlier findings that report few teachers receive training in second language learning but indicates that some of the teaching practices shown to be effective with second language learners are being used in some Swedish schools