Sök:

Sökresultat:

927 Uppsatser om Produce (fruits and vegetables) - Sida 37 av 62

Nätplan för fördelningsstationen TT7142 Ånimskog : Vattenfall Eldistribution AB

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.

Fundamentalism och terrorism ur strukturella förändringar, förhindrad subjektivitet, produktion och reproduktion av diskurser Ett alternativt analytiskt ramverk för konfliktlösning

This essay criticizes common theories within the three traditional perspectives, conflict management, conflict resolution and conflict transformation, for not being able to explain and/or generate solutions to the problems of fundamentalism and religious terrorism in a satisfying manner. This essay is trying to synthesize an alternative analytical framework that better can explaining these phenomena and generate potential solutions. The frameworks ontological ground is laid out using different readings of Foucault, thereby seeing the subject as formed by discourses, material processes and institutions. Fundamentalism and terrorism are seen as a violent resistance to repressed subjectivity, but the form of resistance depends on the discursive and non discursive surroundings. This gives rise to different forms of resistance; the production of discourses and founding of groups and the entry of marginalized people in these groups.

Bioenergins pedagogiska utmaningar. : Utveckling av utbildningsmaterial inom bioenergi och hållbarhet för användning i extramurala lärandemiljöer

The aim of this project was to develop educational resources concerning bioenergy and sustainability. The initial purpose was to produce two sets of material: one suitable for children in their first years of Swedish compulsory school, and one designed for upper secondary students. In the report, however, the possibilities are discussed for this material to be used with even wider audiences.In the first phase of the process, literature (books, reports etc.) with relevance to bioenergy, sustainability and theories of learning were studied. This insight, along with the appropriate course curriculums, was used in the development stage to produce learning material for the targeted audiences. The development was followed by tests and evaluations carried out with high school students, upon which an analytical discussion is held regarding the consequences and possibilities that the results of this project pose.The content of the learning material is based on the curriculum and course requirements provided by Skolverket (The Swedish National Agency for Education) for lower elementary and high school students.

Utsikten över vatten- och strandtillgångs värdeinverkan på fastigheter vid Åsnen och Salen, Kronobergs län

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.

Skolverkets kursplaner - blev det som det var tänkt? En undersökning om grundskolans musikundervisning

AbstractThe future of ethanol is depending on good solutions for the production. ENA energy power plant produces electrical power and district heating by heating biofuel. By building an integrated bioenergy plant surplus steam could be used to produce ethanol as fuel to vehicle.This would mean that ethanol is produced renewable energy and the energy for the process derives from the surplus of power.  ENA energy, MDH (the University of Mälardalen) and the energy authority has initiated a research project were different bioenergy combinations integrate with existing power plant.  As a part of the project which size an integrated factory should be to gain the best efficiency for the plant was investigated. Consideration will be taken to the cost of the production in order to be competitive to the price of imported ethanol.  Etanolens framtid vilar på bra lösningar för framställning.  I ENA energi kraftverk i Enköping produceras el och fjärrvärme genom eldning av biobränsle.  Genom att bygga ett integrerat bioenergikraftverk där skulle man kunna använda överskottsånga till att framställa etanol som fordonsbränsle.

Dokumentationshjälpmedel för poliser i yttre tjänst

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.

Introduktion av IPv6 i en medelstor organisations IPv4 nätverk

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.

Hållfasthetsberäkning av två T-stycken på fjärrvärmerör enligt SS-EN 13941 2003

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.

Ombyggnation av vakuumanläggningen på Stena Danica

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.

Effektivt arbetsmiljöarbete : en studie baserad på några företag

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.

Metaheuristic Multiple Sequence Alignment Optimisation

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.

När en roman blir teveserie: Om Jane Austens aktualisering i och med 1995 års teveinspelning av Pride and Prejudice

The aim of this Masters thesis is to examine how Jane Austens Pride and Prejudice, first published in 1813, was established in different literary orbits after the transformation to the television medium in 1995. I also want to find out what this adaptation meant for the popularity of Jane Austen, the circulation of her works and the rebirth of her authorship. It has furthermore been of interest to discuss the reasons why Jane Austen and her works became so popular. Questions posed in the study are: What has the 1995 production of Pride and Prejudice meant for the spreading of Jane Austens literary work and for the rebirth of her authorship? How has Pride and Prejudice moved between the literary orbits after it became a television-serial in 1995? Why did the circulation get the character it got in the 1990s? In order to find feasible answers to these questions I have used Hans Hertels model of the five literary orbits as theoretical starting point.

SPELA MERA : ?vidareutveckling av design och funktion på Interaktiva VideoTerminaler

This Master of Science thesis is conducted at the faculty Integrated Product Development at theRoyal Institute of Technology and in cooperation with EssNet Interactive AB, both situated inStockholm. In the report the final results and the road to get there is described as well as thedesign process and how the process is used to obtain the goal of this thesis.The author of this thesis has developed the design and the function of an interactive videoterminal (IVT) and by using semantics created an encouraging gaming design. The projectspurpose was to change the anonymous withheld shape and produce an experience of gamingmachine that has been absent. The work was aimed to answer the question: How does oneproceed to develop the IVT and by using semantics creating an understanding of gamingmachine?In general the author wants to show that small changes, with the help of design and its signals,can completely change the overall picture of a product.

En granskning av Utbildningsradions program ur ett mångfaldsperspektiv : En kvantitativ innehållsanalys av 50 program för årskurser 0-3

Utbildningsradion (Swedish Educational Broadcasting Company) is a public service broadcaster with a mandate to produce and distribute educational programmes. 80% of Swedish teachers use its products either during lessons or for professional development. Utbildningsradion?s guidelines, set by the Swedish parliament and government, state that the company?s programmes should meet the interests of the country?s whole population, regardless of their background.The purpose of this study is to examine how Utbildningsradion?s products that are intended to be used in a classroom setting for ages 6 to 9 represent the variety of children that live in Sweden and thus reflect the aforementioned guidelines. The main focus of this research project was further defined to only include the company?s television programmes produced in Sweden between 2006 and 2011 that do not have social issues as the main subject.50 programmes were analyzed using quantitative content analysis and the following results were further interpreted using mainly Kydd?s and Snead?s models for discussing representation.

Det virtuella studierummet : kvantitativ studie av ABF:s DVS

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.

<- Föregående sida 37 Nästa sida ->