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 purpose of this Master?s thesis is to investigate how librarians solve difficult reference questions. The aim is to discuss the nature of reference work ? do librarians make conscious decisions regarding search strategies or do they rely principally on their instincts, or simply chance. The thesis is a qualitative study.

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.

My ambition with his exam is to study how young girls are being depicted in swedish novels of 2010. I have analyzed how the identity and the search for identity are produced in these books. To be able to make my analysis of these books I have used Maria Nikolajeva?s book Barnbokens byggklossar. From wich I have worked out a few questions that I have used my analysis in the portrayal of these girls.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

AbstractAim: The aim of this study was to describe which coping strategies women use when they have been diagnosed with breast cancer. In addition, the purpose was to describe how woman?s self-image changes after a mastectomy. Method: A literature review study has been carried out with a descriptive design. The result of the study included 16 articles which were found in the databases: Cinahl, PubMed, PsycInfo and through manual search.

The aim of this thesis is to investigate the information need of the incubators that comes from Chalmers University of Technology and are situated at Chalmers Innovation. It is also of interest to investigate how Chalmers University Library covers this information need. The investigation was carried out using qualitative interviews with representatives of the incubators. They were asked questions about the perceived need of information and which type of contacts they had with the library. The result is that the incubators feel that there is a great need for business information that is hard to find.

This report deals with RFID systems and how to detect nearby tags with the Mifare standard using only a microcontroller and an antenna circuit.The aim was to investigate whether there was any possibility to continuously search for a nearby tag for a system operated with batteries without compromising   the lifespan of the battery. At this time the system would take too long time to wake up and look for a tag to give a satisfactory battery lifespan, which should be done a couple of times every second.The report has two issues, namely:Is it possible to direct the microprocessor to detect and identify a nearby tag after the Mifare standard?What hardware is required for this to be possible?As the research method to provide answers to the above questions an action research was used. This approach has meant that the group worked on information retrieval, examined existing solutions, tested their own solutions and documented the results.The group examined an existing solution that can search for nearby tags with minimal energy consumption. An antenna circuit was built that was connected to the processor.

The aim of this thesis is to examine how different kinds of information seekers are evaluating information quality in the information flow online. To address the problem stated, qualitative interviews were carried out with a librarian as a reference person and a group consisting of journalists and scientists. The result of the study implies that the reference person is well aware of the strategies employed by her in the search process. However, the respondents are not aware of the strategies they are actually using. An explanation is the respondents lack of education in information seeking.

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.