Results 1 - 10
of
6,103
Rajmic: Impact of priority levels on the efficiency of priority switching
- Proceedings of the 4th WSEAS International Conference on: Telecommunications and Informatics (TELEINFO'05), ISBN: 960-8457-11-4
, 2005
"... Abstract:- The paper deals with a neural network controlled switch fabric with frame prioritization support. The impact of priority levels on the functionality and efficiency of this switch fabric was deeply investigated. The results of the studies related to the impact of the amount of priority lev ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract:- The paper deals with a neural network controlled switch fabric with frame prioritization support. The impact of priority levels on the functionality and efficiency of this switch fabric was deeply investigated. The results of the studies related to the impact of the amount of priority
NETWORK SHARING FAIRNESS FUNCTION WITH CONSIDERATION OF PRIORITY LEVELS
"... An important issue of computer network management is to distribute network resource fairly to its users. The first quantitative fairness score function F x1, x2, � , xn was proposed in 1984 by Jain, Chiu, and Hawe [1] for evaluating network resource sharing fairness. Chen and Zhang [6] proposed ano ..."
Abstract
- Add to MetaCart
another fairness score function G�x1, x2, � , xn� which better fits the real world situation in some cases. This paper considers the situation that the users can have different priority levels. A modified fairness score function G � x, x, , x; w, w, , w � � � is 1 2 n 1 2 proposed. The proposed fairness
Trace Scheduling: A Technique for Global Microcode Compaction
- IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract
-
Cited by 683 (5 self)
- Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages
An Inverse Kinematic Architecture Enforcing an Arbitrary Number of Strict Priority Levels
- The Visual Computer
, 2004
"... An efficient Inverse Kinematics solver is a key element in applications targeting the on-line or off-line postural control of complex articulated figures. In the present paper we progressively describe the strategic components of a very general and robust IK architecture. We then present an efficien ..."
Abstract
-
Cited by 120 (12 self)
- Add to MetaCart
an efficient recursive algorithm enforcing an arbitrary number of strict priorities to arbitrate the fulfillment of conflicting constraints. Due to its local nature, the moderate cost of the solution allows this architecture to run within an interactive environment. The algorithm is illustrated on the postural
Ecology of the family as a context for human development: Research perspectives.
- Developmental Psychology,
, 1986
"... This review collates and examines critically a theoretically convergent but widely dispersed body of research on the influence of external environments on the functioning of families as contexts of human development. Investigations falling within this expanding domain include studies of the interac ..."
Abstract
-
Cited by 518 (0 self)
- Add to MetaCart
; and public policies affecting families and children. A second major focus is on the patterning of environmental events and transitions over the life course as these affect and are affected by intrafamilial processes. Special emphasis is given to critical research gaps in knowledge and priorities for future
The Orchestration of Behaviours using Resources and Priority Levels
, 2009
"... Abstract. Reproducing daily behaviours requires the ability to schedule behaviours depend-ing on resources (body parts for example) and priority (intentions or physiolog-ical parameters) constraints. A simple way is to say that behaviours which are using the same resources are mutually exclusive. Th ..."
Abstract
- Add to MetaCart
levels. In the contrary of some previous approaches, it is not necessary to specify exhaustively all behaviours that are mutually exclusive; this is done implicitely by attaching resources to nodes and a priority function to each state machine, and by using a scheduler.
The Orchestration of Behaviours Using Resources and Priority Levels
- proceedings of EGCAS’ 2001, XII
, 2001
"... Reproducing daily behaviours requires the ability to schedule behaviours depending on resources (body parts for example) and priority (intentions or physiological parameters) constraints. A simple way is to say that behaviours which are using the same resources are mutually exclusive. This approa ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Reproducing daily behaviours requires the ability to schedule behaviours depending on resources (body parts for example) and priority (intentions or physiological parameters) constraints. A simple way is to say that behaviours which are using the same resources are mutually exclusive
The Method for Assigning Priority Levels (MAPLe): A new
, 2008
"... decision-support system for allocating home care resources ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
decision-support system for allocating home care resources
A polling model with multiple priority levels. Performance Evaluation,
, 2010
"... Abstract In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his arrival ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
Abstract In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his
Approximate dynamic programming for dynamic capacity allocation with multiple priority levels
- IIE Transactions
"... In this paper, we consider a quite general dynamic capacity allocation problem. There is a fixed amount of daily processing capacity. On each day, jobs of different priorities arrive randomly and we need to decide which jobs should be scheduled for which days. Waiting jobs incur a holding cost depen ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
depending on their priority levels. The objective is to minimize the total expected cost over a finite planning horizon. We begin by formulating the problem as a dynamic program, but this formulation is computationally difficult as it involves a high dimensional state vector. To address this difficulty, we
Results 1 - 10
of
6,103