Uppsatser om most
7 440 uppsatser · sida 45 av 60
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
arbetspraxis och modell i ett kunskapsföretag
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
en kvalitativ undersökning på Volvo Cars Uddevalla
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
semiotisk analys av marknadsföring på Internet
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
en observationsstudie om mobiltelefonvanor
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
aspekter på implementation och användning av IT-stöd i omogna nätverksorganisationer
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
en studie av hjälpmedelsanpassning
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
en förstudie i hur programvaruutvecklares inställning påverkar deras arbete
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
ett komplement till VIPS
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
Tablet PC för klinisk dokumentation vid postoperativ vård - en kvalitativ studie för OP/IVA kliniken på Uddevalla sjukhus
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
en attitydstudie
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …
Examensarbete, avancerad nivå · Högskolan Väst
… 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) …