Uppsatser om algorithm
273 uppsatser · sida 4 av 19
från sparad tid till framtid
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
hur ser communityanvändare på mIRC?
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en kvalitativ användaranalys av Föreningssparbankens och Skandiabankens Internetbanker
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
ur den administrativa och tekniska personalens synvinkel
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
arbetspraxis och modell i ett kunskapsföretag
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en kvalitativ undersökning på Volvo Cars Uddevalla
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
semiotisk analys av marknadsföring på Internet
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en observationsstudie om mobiltelefonvanor
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
aspekter på implementation och användning av IT-stöd i omogna nätverksorganisationer
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en studie av hjälpmedelsanpassning
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en förstudie i hur programvaruutvecklares inställning påverkar deras arbete
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …