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.

Millions of people are using search engines every day when they are trying to find information on the Internet. The purpose of this report is to find out how people formulate search queries. The result in this report is based on an empirical study which is based on a search log from the Swedish search engine Seek.se.One of the results in this thesis is that nearly all search queries are based on keywords..

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 purpose of this paper has been to identify which modern search functions user of Smartphones are using, why just these functions are being used, and how they have affected the way users acquire information. Modern search functions in this paper means searches that are not based on text, i.e. ways to search for information by other means than writing something into a search field. To identify this, two studies were conducted, one with a questionnaire being distributed with the help of Google Docs through social networks, and one with four interviews with users of modern search functions for Smartphones. The study showed that even though 76 % of Smartphone users are aware of at least one modern search function, only 29% uses one on a regular basis.

The focus of the thesis is an information search technique called manual query expansion, which aims to improve the retrieval per-formance in a search system by adding terms to the search query. The study looks at the query expansions done by LIS students, and the eventual beneficial effects by using a search help during the search process. The empirical data have been collected thro-ugh an experiment, with an experiment group as well as a control group. The conclusion is that the students need more education in query expansion in order to be able to use it correctly. There are significant differences between the groups in several aspects, for example in the use of search terms, parentheses, and truncation.

This report examines the possibility of optimizing troubleshooting log files generated when constructing new Volvo trucks. Errors occur when CAD models are stored and managed by the versioning system PDMLink. By developing a new diagnostic tool, Log Search, the troubleshooting process is automated and thereby streamlines the current manual search..

The aim of this Master?s thesis is to examine the retrieval performance of two search engines, Yahoo! News and Sesam, specialized on indexing news articles in Swedish. Thirty search questions were used in this study, divided into three different categories: domestic news, amusement and sport. Precision has been calculated both for the 30 search questions as a total and for the three categories as well. Precision was calculated at every DCV-level and then divided with the number of search questions used, in an attempt to reach an average measure.

In this essay, a search strategy for citation index is studied. The strategy, which is essentially a citation cycle, starts with documents retrieved by a subject search, wherefrom new documents are identified following the network of citations backwards and forwards in time. Based on the theory of polyrepresentation, the strategy exploits overlaps between cognitively different interpretations of the same documents in order to automatically select references seed documents used as a starting point for the forward chaining. The purpose of the investigation is to evaluate the retrieval effectiveness of the search strategy and to find out whether the strategy can be used to expand a subject search with the help of the network of references in order to retrieve new relevant documents. Two questions are formulated: 1a.

The purpose with this essay is to evaluate the retrieval performance between Googles basic search and the advanced search functions. A secondary purpose is to evaluate the differences between the binary relevance scale and a 4- point scale. The basic search is defined as a search with two terms combined with the Boolean operator AND. The advanced search is based on search functions that are adequate to compare to the basic search. They are categorized as AND-searches, OR-searches, AND and OR-searches, exact phrase, and depending on where the terms occur on the page.

The purpose of this thesis is to examine how novices set about when they search for information. Marchionini's information-seeking model is the theoretical starting point, which is supplemented by theories of other specialists within the field, such as Chowdhury; Harter; Large, Tedd and Hartley. As method a questionnaire survey was used. The questionnaire was sent to 96 students at IHM Business School in Gothenburg and 57 questionnaires were returned. The results show among other things that the majority of the students used highly interactive search strategies, and they did not plan their search before they carried out the search.