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 bachelor?s thesis is to examine how students at Högskolan i Borås experience the web-scale discovery service Summon, based on the theoretical model of ?The Five Dimensions of Usability?, defined by Whitney Quesenbery. The study aims to answer the following research questions: How do the students execute search assignments in the Summon interface? How intuitive and easy to navigate is the system from a user perspective? What are the students? opinions about Summon, regarding usability?Five students with varying information seeking skills are asked to perform search assignments during controlled observation, followed by semi-structured interviews. Our findings are presented in the context of previous research and show correspondence with the results of related studies.

The writing style of a particular author can be divided into many subfeatures, for example use of words, language and syntax. Focusing on the latter, this study aims to show how well syntactic information alone can attribute the correct author to a document. Syntactic information is defined as overlapping syntactic subtrees of height one (1) for all sentences of all included documents. The performance is compared to that of the previously very successful method of comparing stop word frequencies. These are words normally excluded from search engine queries, because they are present in all sorts of texts regardless of topic.

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 aim of this thesis is to accomplish an understanding on how librarians experience their professional role at private companies. The study is based on qualitative interviews with persons who have a degree in Library and Information science, but does not work as an ordinary librarian. To answer why the respondents work at private companies, this thesis dwells on how the education in library and information science prepares their students to face an alternative career; why the respondents wants to work at private firms instead of a library; if the salary is a key factor in order to choose a career; if the respondents think the companies appreciate their qualifications, and finally, if the respondents think they intrude on other professions' territory? Working at a private company, with a degree in library- and information science, is not, according to the respondents, easy. Although appreciated by their knowledge in the field of information, the interviewees think that the title librarian is hard to cope with.

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 content of the following report is the summarized result of three students thesis at Blekinge Institute of Technology in co-operation with Water Jet Sweden AB. This report will give the reader a description of principles how to measure the abrasive mass flow in a waterjet cutting system. The work began with a visit to Water Jet Sweden AB to get a closer look at the problem. When the analysis of the problem was done the criteria were defined in the form of demands and desires. The main task of the criteria was to guide the search for the solution.

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.

This study examines use and users of information and records originating in the context of a contemporary police organisation. This area of research has only been of focus for a relatively few researchers. This in contrast to use and users of historical archives which has been in centre for more studies. The study is conducted with a quantitative method structuring data from 120 selected registered matters containing user queries. The research questions addressed are:- what user categories use the records of the authority- which are the ways of contacting the authority preferred by the users- which are the identifiers provided by the users and how well are they matched by the search artefacts available to the staff of the authority- what information and records are sought-after by the users.For comparing the identifiers provided to the search artefacts has been selected the two most frequently used registry systems within the authority.

Previous research analyzing information and communication effects regarding high-involvement purchases has so far concerned communication length and the use of salient attributes. Studies investigating the effects of communication on a word-level is however limited. For a high-involvement purchase like an apartment the need for information is vital in the customers purchase decision. The main purpose of this study is to investigate whether the communication in the prospectus varies based on sales success. The study connects research in Information search, high-involvement purchases, communication length and information vividness.