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