Sökresultat:
3648 Uppsatser om Timescale in local planning - Sida 29 av 244
Ett kulturcentrum i Ulricehamn?
The aim of this essay is to investigate and evaluate the arguments made by municipal politicians in Ulricehamn, regarding the planned Knowledge and Culture Centre. A part from the search for these arguments, I also investigated the attitudes among politicians regarding municipal culture investments in general. I furthermore investigated whether any national, regional, or local culture-political strategies were important in the local debate. The time frame within which the local political culture debate was investigated was from 1997 until present time 2002. The investigation methods used were partly a study of official documents such as political protocols, two articles from the local newspaper, and a clean copy from a web chat, and partly a qualitative study I sent a question regarding the planned Culture Centre to every political party active in the Ulricehamn municipal assembly.
Barns röst och delaktighet i kommunalpolitiken
A qualitative study is presented concerning children?s participation in the local decisionmaking in Swedish municipalities. The study also aims at finding out what are considered to be successful factors and obstacles connected to the implementation of children?s participation in local decision-making. The study contains a summary of the convention on the rights of the child, focusing on article 12, as well as previous research findings concerning children?s participation and factors enabling respectively hindering participation.
Vindkraftsplanering i skogsmark
The aim of this study about wind power planning in forest was to examine the factors and restrictions, which represent technical limitations, biodiversity, tourism and amount of energy for wind farms in Kronoberg County. Suitable areas for wind power were identified from the collected information about planning principles and potential conflicts. From the suitable areas the potential energy gain is calculated. Methods used were mainly a literature review, interviews with experts and practitioners, GIS analysis and a rough calculation of the energy gain. The section of information and facts describes in general wind power planning and possible conflicts.
Att sälja ett beteende : En undersökning av en social marknadsföringskampanj
AbstractCommunication and information has become a large industry in today?s society. More and more organisations use these means as tools of influence. Non-profit organization?s campaigns, which aim to change a behavior, often have a political responsibility and it is therefore important that these are carefully planned and carried through.
Planering och val av metod i byggprojekt
This report describes the construction process and the aspects that should be taken into consideration. It includes models of decision and how these can be used in practice. Planning of a building project is very important for a successful execution. This will be the foundation of problems that will occur during the production. In the planning process people with different positions, search for the best suitable building methods.
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.
Tillgänglighet hela vägen - för funktionshindrade men även för alla andra - fallstudie: några service- och rekreationsmålpunkter i Båstad tätort samt större stråk däremellan
Det är viktigt att alla kan känna sig fria att använda den fysiska miljön. För
det krävs bl.a. en god tillgänglighet.
År 2001 antog riksdagen en nationell handlingsplan för handikappolitiken som
ger riktlinjer om ökad tillgänglighet bl.a. ska enkelt avhjälpta hinder
åtgärdas senast år 2010.
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.
Läsbar stad - orienterbarhet i Falköping
För nyinflyttade och besökare styr stadens orienterbarhet vad vi upplever genom
att stadens platser är olika lätta att hittat. Hur vi upplever staden påverkas
av i vilken mån vi förstår dess uppbyggnad och känner oss välkomnade. Men även
alla som länge bott i staden har glädje av att den är logiskt strukturerad. Om
vi kan röra oss på ett effektivt sätt kan vi snabbare uträtta ärenden. En
tydlig bild av omgivningen är en förutsättning för att ge hemstaden betydelse,
och det är en grund för känslan av gemenskap och samhörighet i staden.
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.
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.
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.
Incorporating the future - a study of three companies? internalisation of future trends forecasting and scenario planning.
Purpose:The purpose of this thesis is: to determine key success factors for an organisation?s internal process of internalising future trends forecasting. Methodology:A qualitative approach has been chosen by examining three different companies (Electrolux, H&M and, Sony Ericsson) through interviews and other data. The empirical material have been analysed by using valid theory as a platform from where the analysis can be performed. This has created a conceptual analysis that enables the use of the conclusions in other similar companies.