The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

Today?s society has become a society of information were communication has become more important to manage, both for companies and for the person as an individual. If you want your message to be successful you have to plan your communication and also evaluate the result. The administration of health and care in Karlstad had already planned and performed an information campaign, ?Vård & omsorg ? Mer än ett jobb? (translation ?Health & care ? More than a job?), and therefore we got the assignment to investigate the rate of success.The investigation is based on both theory and empiric.

The purpose of this study was to use qualitative interviews with students at Södertörn University to find out what drives the men who begin to study for preschool teachers, how they are treated and how they are influenced by others. I also wanted to find out what the informants believe is the cause to why so few men apply to the program and what they think need to happen to change this.This is a qualitative study based on the selected students' experiences. In order to get different perspectives, I chose to interview three students and former students. One of them chose to terminate their studies after half the time, the second is at the end of the program and the third graduated a couple of years ago and has been working for a while.I originated in the theory of ethical concepts of gender, gender contract, "token" and hegemonic masculinity. Previous research addresses that the perception of men in pre-schools can look very different.

The goal with this project was to achieve real-time synchronized video playback over the Internet, or in other words, that multiple clients play the same part of a video at the same time.The result shows how it is possible to build such a protocol, that gives a user experience that the video is synchronized between computers when playing a locally stored file, stream or video delivered using progressive download. This was achieved by designing, then role playing to find weaknesses, and at last implementing the protocols to see how they work in practice. By using such a protocol, it is possible to navigate and discuss around a video in for example a telephone conference, and be sure that everybody is looking on the same picture..

Children at the age of six, has since 1991 been allowed to start their tuition in the Swedish school system. Studies reveal that; the first school year (preschool) can be a stressful task dueto the new environment, new friendships and higher expectations.The purpose of this study is to describe and analyze how the teachers perceive their own role in the transitioning process from preschool to school. This purpose required a method of qualitative complexion and therefore qualitative interviews were used. The material is based on four interviews with four different teachers. The teachers were asked the same question considering; the transition from preschool to school from a pupil point of view, their own role in that transition and their opinions on different educational tools.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

BackgroundWhen women have breast pain this usually is not associated with myocardial infarction, which results in that they get less attention and wrong treatment. The nurse has an important role in informing and educating patients and families during hospitalization, which is usually short. Continuous training, written information and repetition for patient and family throughout the hospital stay are of considerable importance to clarify that the patient understands and to reduce the anxiety of being discharged.AimThe aim is to describe nurses' experiences of caring for older women with myocardial infarction.MethodsA qualitative method was used. The collection of data was done by six interviews with nurses in geriatric care and elderly care. Dataset has been processed based on a content analysis and divided into subcategories and main categories using meaningful units.ResultsNot having knowledge of older women with myocardial infarction was expressed as frustrating and nurses described how they were afraid to ask their colleagues.

The aim of this study was to understand the contact between foster homes and social workers, by doing a comparison of the social workers and the foster homes experiences of the cooperation that is between them. We started from three main questions to get an answer to our aim, how the foster homes and the social workers experience the organization of the foster care in the Social Service as an impact of the cooperation, what does the foster homes and the social workers experience as a important fact of a successful placement and finally, how does the foster homes and the social workers experience the supporting and controlling contact that is between them. To get our results we based our study on interviews whit four foster homes and whit four social workers. The analysis was based on one theoretical perspective, Skaus (2007) analytical approach for power and help. As a conclusion we have found out, that the organization of the Social Service has significance for the contact between social workers and foster homes.