Results 151 to 160 of about 2,684,636 (188)
Some of the next articles are maybe not open access.
Learning the task allocation game
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, 2006The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators. Servers execute tasks and may differ in their capabilities, e.g. one server may take more time than the other in executing the same task.
Sherief Abdallah, Victor R. Lesser
openaire +1 more source
Task Allocation for Spatially and Temporally Distributed Tasks
2013In multi robot task allocation, a set of tasks has to be allocated to a group of robots while optimizing some measure (for example, fuel or time). In order to find the optimal allocation, an exponential number of possibilities must be explored. In this work, we extend the Consensus Based Bundle Algorithm, to improve its support for tasks with time ...
Julio Godoy, Maria L. Gini
openaire +2 more sources
Task allocation in manufacturing: A review
Journal of Industrial Information Integration, 2019Abstract Task allocation (TA) problem is of critical importance in manufacturing industry, and determines the effectiveness and efficiency of advanced manufacturing systems. A proper TA approach can give an optimized arrangement of existing resources, enable manufacturing system's flexibility, thus improve both economic performance and social ...
Ying Cheng 0001 +3 more
openaire +1 more source
Preferences of agents in decentralized task allocation [PDF]
AI Communications, 2009 The ability to express preferences for specific tasks in multi-agent auctions is an important element for potential users who are considering to use such auctioning systems. This paper presents an approach to make such preferences explicit and to use these preferences in bids for reverse combinatorial auctions.
Mark Hoogendoorn, Maria L. Gini
openaire +3 more sources
Task allocation for reconfigurable teams
Robotics and Autonomous Systems, 2015Self-reconfigurable robots are systems built from a collection of modules that have the ability to form themselves into many different topologies. This includes forming robots of different shapes, but also includes dividing and merging to form different numbers of physically independent robots during the course of the mission.
Zack Butler 0001, Jacob Hays
openaire +2 more sources
Annals of Operations Research, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Billing +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Billing +2 more
openaire +3 more sources
Task Allocation by Parallel Evolutionary Computing
Journal of Parallel and Distributed Computing, 1997In this paper we will investigate the applicability of parallel evolutionary algorithms to the task allocation problem?a long standing problem in parallel computing. Three different evolutionary optimization strategies, genetic algorithms, simulated annealing, and steepest descent, are formulated in a parallel generic framework. In order to enhance the
Schoneveld, A. +2 more
openaire +2 more sources
Integration of dependability in a task allocation problem
IMTC/2002. Proceedings of the 19th IEEE Instrumentation and Measurement Technology Conference (IEEE Cat. No.00CH37276), 2003The tasks allocation on various components or processing units composing an automation system needs a design-aided methodology in order to both obtain relevant architecture of this automation system and a sufficiently efficient tasks allocation.
Bicking, Frédérique +2 more
openaire +2 more sources
Task Allocation in a Multi-Server System
Journal of Scheduling, 2003We consider a slotted queueing system with C servers (processors) that can handle tasks (jobs). Tasks arrive in batches of random size at the start of every slot. Any task can be executed by any server in one slot with success probability α. If a task execution fails, then the task must be handled in some later time slot until it has been completed ...
Sem C. Borst +3 more
openaire +3 more sources
Task allocation in the star graph
IEEE Transactions on Parallel and Distributed Systems, 1994The star graph has been known as an attractive candidate for interconnecting a large number of processors. The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks.
openaire +1 more source