Results 211 to 220 of about 41,270 (263)
Some of the next articles are maybe not open access.
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 2003
This paper presents a brief description of an intelligent system, used in the control of load exchange between two robotic manipulators. An intelligent tasks scheduler, that uses mainly fuzzy logic to define which task will be executed in a certain instant, controls the whole system. Tasks are used in actions and in system control. In a low level, each
Jose Ricardo da Silva Ferreira +2 more
openaire +1 more source
This paper presents a brief description of an intelligent system, used in the control of load exchange between two robotic manipulators. An intelligent tasks scheduler, that uses mainly fuzzy logic to define which task will be executed in a certain instant, controls the whole system. Tasks are used in actions and in system control. In a low level, each
Jose Ricardo da Silva Ferreira +2 more
openaire +1 more source
On the Scheduling of Hyperperiodic Tasks
Fifth Euromicro Workshop on Real-Time Systems, 1993A comn model for the study of real-time systems has been the periodic task. However, only some of the realtime processing is truly periodic in nature. The repetitive behavior is mainly intended to monitor the environment and detect any changes promptly. In this paper, we propose a new model for real-time tasks called hyperperiodic tasks.
Sudhir Aggarwal, Chakib Chraibi
openaire +1 more source
Scheduling Tasks with AND/OR Precedence Constraints
SIAM Journal on Computing, 1995Summary: In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper, we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks.
Donald W. Gillies, Jane W.-S. Liu
openaire +1 more source
Scheduling independent multiprocessor tasks
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdel Krim Amoura +3 more
openaire +1 more source
Task scheduling with RT constraints
Proceedings of the 37th conference on Design automation - DAC '00, 2000This paper addresses the problem of schedu ling reactive real-time tran saction s(task groups) implementing a net work of extend ed Finite State Machines comm unicating asynchronously. Task instances are activated in response to internal and/or external ev ents.The objective is avoiding the loss of events exchanged by the tasks.
DI NATALE, Marco +2 more
openaire +2 more sources
European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Scheduling Periodic Tasks with Slack
INFORMS Journal on Computing, 1997We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of identical processors, assuming that some slack is allowed in the time between successive executions of a periodic task. We prove that the problem is NP-hard in the strong sense.
Korst, J.H.M. +2 more
openaire +2 more sources
Task scheduling in multiprocessing systems
Computer, 1995The complex problem of assigning tasks to processing elements in order to optimize a performance measure has resulted in numerous heuristics aimed at approximating an optimal solution. This article addresses the task scheduling problem in many of its variations and surveys the major solutions.
El-Rewini, Hesham +2 more
openaire +2 more sources
Multifunction Radar: Task Scheduling
Journal of Mathematical Modelling and Algorithms, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cyril Duron, Jean-Marie Proth
openaire +2 more sources
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers, 1986The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its
Jacek Blazewicz +2 more
openaire +2 more sources