Sök:

Sökresultat:

934 Uppsatser om Genetic advantage - Sida 27 av 63

Utveckling av en provmetod för ett CAN-baserat 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.

Beslutstödssystem för trafikplanering : från sparad tid till framtid

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.

Arbetet inom skolan för att förebygga mobbning

My purpose in this work was to find out how staff in a middle sized school uses its local Equal treatment plan in its work against bullying. But also to see how the use of a standardized anti-bullying program works to prevent bullying. I have interviewed the principal, teachers, and what we in Sweden call a ?fritidspedagog? and the members of the anti-bullying team to get answers to my questions.  The conclusion of this study is that the school follow and work according to what the Equal treatment plan states, both in terms of prevention, as in working with actual bullying cases. The school has also followed the National School Agency's recommendations on what should be the local Equality plan, but also to follow up and revise it each year. The interview shows that the staff at the school placed great emphasis on talking and discussing with students about how to behave towards each other, they also brought up things that happened at one time and talked about this. The staffs were very committed to work towards the prevention of bullying and the same was true with the school's headmaster.

Orsaker till kalvningssvårigheter och dödfödslar hos SLB och SRB

Difficult calvings and stillborn calves are costly for the producer and lowering these frequencies can decrease the costs for the dairy operation. Each calving in the herd is registered by the farmer and stored in a central database. The information is used to monitor the level of calving-difficulties and stillborn calves in the herd and nationally. Monitoring of these registrations is important to detect possible changes. Breeding-value prediction for calving traits is based on the calving information in the database.

Anpassning av befintligt stomnät för GPS-mätning i Åmåls kommun

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.

Utveckling av logik till bältespåminnare för baksäte : Saab Automobile 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.

Förbättrad internrevision : av ledningssystem för miljö och kvalitet på EKA Chemicals AB i Bohus/Rollsbo

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.

Ensemblespel : Ett socialt redskap främjar såväl interaktion som integration

Being an immigrant in a Swedish school today might not be easy. It´s quite difficult to be accepted and becoming a part of an already functioning group. Difficulties with the Swedish language doesn´t make it easier. Besides that the requisites of the school curriculum program are very demanding and Swedish students are often in advantage already being a part of the system for many years.By following five immigrant boys in grade 6 during ten ensemble lessons, one concert and individual interviews with the boys as well as with their teacher, this study aims to investigate how ensemble playing can function as a social tool and promote interaction as well as integration.The results in this study show that ensemble playing in fact can function as a social tool. The boys developed abilities in playing an instrument as well as cooperating and analyzing by using the social tool of ensemble playing.The results even show that ensemble playing can promote interaction as well as integration.Above everything was the concert where the boys acted in front of their classmates and were treated with great respect and acceptance..

Demokrati i cyberrymden

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.

Wool loss in sheep

The idea behind this project came from a feed study executed two years during the lambing season. Both years wool loss was experienced. Low temperature in combination with shearing was believed to cause the wool loss the first year, while protein deficiency was believed to be the cause the second year. In the literature many causes of wool loss are described; mechanical wear, telogen effluvium, bacterial dermatitis, external parasites, wool break, scrapie, genetic causes and nutritional deficiencies are some examples. The aim of this thesis was to study causes for wool loss and how common wool loss is in Swedish sheep herds.

Design and Analysis of an All-optical Free-space Communication Link

Free Space Optics (FSO) has received a great deal of attention lately both in the military and civilian information society due to its potentially high capacity, rapid deployment, portability and high security from deception and jamming. The main issue is that severe weather can have a detrimental impact on the performance, which may result in an inadequate availability. This report contains a feasibility study for an all-optical free-space link intended for short-range communication (200-500 m). Laboratory tests have been performed to evaluate the link design. Field tests were made to investigate availability and error performance under the influence of different weather conditions.

Potential och användande av mobila tjänster inom högre utbildning

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.

Användning av programvaran Templife för analys av överbelastbarheten hos ett urval av Vattenfall Västnäts krafttransformatorer

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.

Processen att tillhandahålla reservdelar, Saab Automobile AB : k+D769artläggning och förslag till förbättringar

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.

Marknadsföring via Webb-TV - En studie som handlar om möjligheter och begränsningar med att annonsera på Webb-TV

Purpose: The purpose of the essay is; to explain and clarify how the company is acting to lead members in social media to achieve valuable external communication. The authors believe that it is important to act with credibility and quality in social media, to accomplish long lasting relationships. When employees communicate with consumers their conduct is relevant to the company's credibility.Methodology: An inductive approach has been used for the empirical data collection since the authors have been studying the reality without existing theories. A qualitative research method has been used for collecting the empirical material. Primary data was collected from telephone interviews with seven companies, active in social media.Conclusions: The study shows that the power of employees? can be used when designing strategies for social media.

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