
Sökresultat:
4068 Uppsatser om Methods - Sida 35 av 272
En miljo?ja?mfo?relse av traditionellt stambyte kontra relining av tappvattenro?r : Med hja?lp av livscykelanalys
This study was a final thesis, for the bachelor program in civil engineering at theUniversity of Uppsala, which was made on behalf of Riksbyggen in Uppsala. Acomparative study of two stain renovation Methods; tradition pipe replacement andrelining was done with an environmental perspective. A simplified life cycleassessment (LCA) was done according to the International Organization ofStandardization (ISO) with the LCA tool Eco-indicator 99, in order to be estimate theimpact on the environment. LCA is a method that follows a product or a system?from the cradle to the grave?, which means that all the environmental impact over alifetime is considered.The work was executed by using a stairway with nine apartments in a house called?Uppsala Hus 9? as a reference object, which was provided by Riksbyggen.
Miljöutredning av gaturenhållningen, park- och naturförvaltningen i Göteborgs Stad
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.
Studentens användning av elektronisk handel och dess tjänster
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.
Strukturerat arbete vid verksamhetsplanering och mjukvaruuttveckling : en studie på Volvo IT i Trollhättan
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örslag till nytt energimätningssystem på Volvo Aero Corporation i Trollhättan
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 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.
Förbättring av tillgänglighet robotcell för diskmaskinsbehållare samt cylinder-behållarline tvättmaskinscylindrar och behållare
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.
"Eftersom det är en lagidrott förväntar sig spelarna att någon bestämmer" : En kartläggning av kunskaperna rörande träningsmetodik inom svensk pojkishockey
The purpose of this study was to examine social workers working process in social assistance with focus on the child´s perspective. We were interested in learning about the existence of variations in approach and attitude between two municipalities. Question to be answered about what Methods and approaches used by social workers to include the child´s perspective in the process of social assistance. Another question to be answered about what the manner in which social workers took into account the child´s perspective when the families apply for social assistance in relation to the operations and requirement. To fulfill the purpose, qualitative Methods were used.
Stor problematik på liten yta : Att skriva informationsmaterial för skattefinansierade verksamheter
The purpose of this thesis has been about processing an already existing folder for a tax funded organization which is also the employer for this mission ? Expectrum. The reason is that both Expectrum themselves and the recievers of the folder are unhappy with the existing material. The critic that has been directed to Expectrum is that the recievers have trouble understanding what Expectrum is and what they do. Based on qualitative Methods such as interviews and text analysis I?ve been able to answer my questions for this thesis.
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.
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.
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.
Metod för att bestämma drifttid
The usage time is an important part of the specification for products powered bybatteries. The usage time is affected by a number of different elements; technical,environmental and how the product is being used. The method to determine theusage time is intended to define how measurements and calculations are to berealized along with influencing factors to keep in mind. With support from thismethod the intention is to gain control on how well the established usage time canbe expected to cohere with the real value and what affects the value.The study is done specifically for hearing protectors with battery powered built inelectronically functions. The functions can be level dependent function forambient hearing, 2-way radio communication, Bluetooth or FM-radio.The first chapter of the report describes the literature study performed in theproject.
Immobilisering av extremitetsfrakturer inom ambulanssjukvård : Ett pilotprojekt med SAM-splint
Within the ambulance care in Uppsala County a vacuum splint is used to immobilize fractures on extremities. The research available on which method of immobilizing to prefer during pre-hospital treatment is limited. The purpose of this pilot study was to examine the perceptions of the ambulance personal in Uppsala County on the issue of usability of SAM-splint and vacuum splint when immobilizing extremities. The project was also aimed at researching if SAM-splint could be seen as an alternative or a complement to vacuum splint, and to get an apprehension on any evident differences in patients? perceived pain when treated with the two different approaches. A descriptive comparative study was carried out. All patients, regardless of age and sex, with the need of immobilizing supposed fractures, were included. Patients with suspected femur fracture, collum fracture, or where pre-hospital care was not possible or in question, was excluded.