Uppsatser om climbing
119 uppsatser · sida 3 av 8
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
kvantitativ studie av ABF:s DVS
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
från sparad tid till framtid
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
hur ser communityanvändare på mIRC?
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en kvalitativ användaranalys av Föreningssparbankens och Skandiabankens Internetbanker
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
ur den administrativa och tekniska personalens synvinkel
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
arbetspraxis och modell i ett kunskapsföretag
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en kvalitativ undersökning på Volvo Cars Uddevalla
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
semiotisk analys av marknadsföring på Internet
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
en observationsstudie om mobiltelefonvanor
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …
aspekter på implementation och användning av IT-stöd i omogna nätverksorganisationer
Examensarbete, avancerad nivå · Högskolan Väst
… 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 …