Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
13
On the Latency Bound of Pre-Order Deficit Round Robin
, 2002
"... In the emerging high-speed packet-switched networks, packet scheduling algorithms used in the switches and routers will play a critical role in satisfying the Quality of Service (QoS) requirements of various applications. The latency bound of a scheduling discipline is an important QoS parameter, es ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Pre-order Deficit Round Robin, a novel scheme that overcomes this limitation of DRR while still achieving a low work complexity. In Pre-order DRR, a priority queue module is appended to the original DRR scheduler which re-orders the packet transmission sequence in DRR to distribute the output more
On the latency and fairness characteristics of pre-order deficit round Robinq
, 2003
"... In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to satisfy the Quality of Service (QoS) requirements of various applications. The latency bound of a scheduling discipline is an ..."
Abstract
- Add to MetaCart
Networks 35 (2001) 287], the authors propose a novel scheme, called Pre-order DRR, which overcomes this limitation of DRR while still preserving a low work complexity. In Pre-order DRR, a priority queue module, appended to the original DRR scheduler, re-orders the packet transmission sequence and thus
1On the Latency and Fairness Characteristics of Pre-Order Deficit Round Robin ∗
"... In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to satisfy the Quality of Service (QoS) requirements of various applications. The latency bound of a scheduling discipline is an ..."
Abstract
- Add to MetaCart
], the authors propose a novel scheme, called Pre-order Deficit Round Robin, which overcomes this limitation of DRR while still preserving a low work complexity. In Pre-order DRR, a priority queue module, appended to the original DRR scheduler, re-orders the packet transmission sequence and thus distributes
Lifting assertion and consistency checkers from single to multiple viewpoints
, 2002
"... Using a priority preorder on requirements or specifications, we lift established property-verification techniques of threevalued model checking from single to multiple viewpoints. This lift guarantees a maximal degree of autonomy and accountability to single views, automatically synthesizes single-a ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Using a priority preorder on requirements or specifications, we lift established property-verification techniques of threevalued model checking from single to multiple viewpoints. This lift guarantees a maximal degree of autonomy and accountability to single views, automatically synthesizes single
Johan van Benthem and Davide Grossi Normal Forms for Priority Graphs Normal Forms for Priority Graphs ∗
"... This brief note compares a few ways of deriving pre-orders over sets of objects from strict partial orders over properties of those objects — so-called priority graphs that have recently been used by logicians as a rich explicit model of preference merge, belief revision, norm change, and other aspe ..."
Abstract
- Add to MetaCart
This brief note compares a few ways of deriving pre-orders over sets of objects from strict partial orders over properties of those objects — so-called priority graphs that have recently been used by logicians as a rich explicit model of preference merge, belief revision, norm change, and other
Non-Monotonic Reasoning: From Complexity to Algorithms
- ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
, 1996
"... We focus on coherence-based approaches to non-monotonic reasoning. These approaches handle syntactical belief bases equipped with symbolic ordering structures and rely upon classical logic. The belief base, a finite set of propositional formulae, is considered syntactically, as in (Nebel 1991): eac ..."
Abstract
-
Cited by 16 (0 self)
- Add to MetaCart
that the belief base is equipped with a complete pre-ordering structure (a priority relation) which, contrarily to (Gardenfors & Makinson 1994), is not related to the semantical entailment ordering. So, the base is stratified in a collection of subbases of different priority levels. Coherence
Possibilistic Logic Framework
"... In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowled ..."
Abstract
- Add to MetaCart
In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete
Approximation of Conditional Preferences Networks “CP-nets ” in Possibilistic Logic
"... Abstract — This paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: the conditional preferences networks (CP-nets) and a logical preference representation framework, namely the possibilistic logic. It is shown that possibilistic lo ..."
Abstract
- Add to MetaCart
logic, using a method for handling symbolic priority weights, can always provide complete preorders compatible with the partial CPnet order. Although CP-nets provide an intuitive appealing setting for expressing preferences, possibilistic logic appears to be somewhat more flexible for that purpose. I.
Multi-Agent Belief Dynamics: bridges between dynamic doxastic and doxastic temporal logics
- LOFT AMSTERDAM & WORKSHOP ON INTELLIGENT INTERACTION ESSLLI
, 2008
"... In this paper, we compare two modal frameworks for multi-agent belief revision: dynamic doxastic logics computing stepwise updates and temporal doxastic logics describing global system evolutions, both based on plausibility pre-orders. We prove representation theorems showing under which conditions ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we compare two modal frameworks for multi-agent belief revision: dynamic doxastic logics computing stepwise updates and temporal doxastic logics describing global system evolutions, both based on plausibility pre-orders. We prove representation theorems showing under which conditions
CP-nets and possibilistic logic: Two approaches to preference modeling Steps towards a comparison
"... This paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: the CP-net and the possibilistic logic frameworks. It is shown that the second approach, using a method for handling symbolic priority weights, can always provide complete pr ..."
Abstract
- Add to MetaCart
This paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: the CP-net and the possibilistic logic frameworks. It is shown that the second approach, using a method for handling symbolic priority weights, can always provide complete
Results 1 - 10
of
13
