Cta Algorithm Time Critical by Valadares Henrique (6 results)

Paperback. Condition: Brand New. 60 pages. 8.66x5.91x0.14 inches. In Stock.

Taschenbuch. Condition: Neu. CTA - An algorithm for time critical task assignment problems | Henrique Valadares | Taschenbuch | 60 S. | Englisch | 2018 | Scholars' Press | EAN 9786202302869 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 60 pp. Englisch.…

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Valadares HenriqueI hold a Bachelors degree in Computer Science. I did an internship as a Java Developer at the GIS deparment of Belo Horizonte City Hall for 2 years. I worked for 8 months at Capgemini. Later I worked for 4 months as.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch.…