CTA - An algorithm for time critical task assignment problems / Najlacnejšie knihy
CTA - An algorithm for time critical task assignment problems

Kód: 19009129

CTA - An algorithm for time critical task assignment problems

Autor Henrique Valadares

Time critical task assignment problems are frequently found in operating systems and flight control applications. For instance, in a flight control real time application, one wrong task assignment decision could result in an airpl ... celý popis

41.01

Bežne: 48.13 €

Ušetríte 7.12 €


Skladom u dodávateľa
Odosielame za 5 - 8 dní
Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darujte túto knihu ešte dnes
  1. Objednajte knihu a vyberte Zaslať ako darček.
  2. Obratom obdržíte darovací poukaz na knihu, ktorý môžete ihneď odovzdať obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nič sa nestaráte.

Viac informácií

Viac informácií o knihe CTA - An algorithm for time critical task assignment problems

Nákupom získate 99 bodov

Anotácia knihy

Time critical task assignment problems are frequently found in operating systems and flight control applications. For instance, in a flight control real time application, one wrong task assignment decision could result in an airplane accident. To make things worse, these crucial decisions have to be taken in milliseconds. In order to address time critical task assignment problems, the Clustering Task Assignment Approach (CTA) is proposed. The idea is to cluster the groups into tasks with the best candidates(free agents) according to a heuristic. In other words, the place where agents needs to reach(task facility) is designed as a cluster centroid and the agents inside each cluster are the candidates to execute each task. Agents compete with each other by means of an objective function in order to define the assigned task. The algorithm is compared against the well known Contract Net Protocol(CNET) and outperform it in terms of speed reducing the number of calls to the score function in 400%, the solution quality is 28% better as well. This algorithm was designed to work with time critical applications in which agents have to move from one place to another.

Parametre knihy

41.01

Obľúbené z iného súdka



Osobný odber Bratislava a 12792 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: