Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,595
Simple priorities and core stability in hedonic games.
- Social Choice and Welfare,
, 2006
"... Abstract In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies ..."
Abstract
-
Cited by 18 (4 self)
- Add to MetaCart
Abstract In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion
A simple priority mechanism for shared-protection schemes
- IEEE Communications Letters
, 2007
"... Abstract — One of the major challenges of optical network op-erators is ensuring the stringent levels of availability required by their highest-class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the protection paths. In t ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract — One of the major challenges of optical network op-erators is ensuring the stringent levels of availability required by their highest-class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the protection paths
Genetic Programming (GP). While Simple Priority
"... (FJSP) by using dispatching rules discovered through ..."
Transactional Memory: Architectural Support for Lock-Free Data Structures
"... A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems asso ..."
Abstract
-
Cited by 1031 (27 self)
- Add to MetaCart
that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.
Resource Containers: A New Facility for Resource Management in Server Systems
- In Operating Systems Design and Implementation
, 1999
"... General-purpose operating systems provide inadequate support for resource management in large-scale servers. Applications lack sufficient control over scheduling and management of machine resources, which makes it difficult to enforce priority policies, and to provide robust and controlled service. ..."
Abstract
-
Cited by 498 (10 self)
- Add to MetaCart
the notion of a protection domain from that of a resource principal. Resource containers enable fine-grained resource management in server systems and allow the development of robust servers, with simple and firm control over priority policies. 1
The iSLIP Scheduling Algorithm for Input-Queued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract
-
Cited by 425 (8 self)
- Add to MetaCart
that if simple first in first out (FIFO) input queues are used to hold packets then, even under benign conditions, head-of-line (HOL) blocking limits the achievable bandwidth to approximately 58.6 % of the maximum. HOL blocking can be overcome by the use of virtual output queueing, which is described
Valued constraint satisfaction problems: Hard and easy problems
- IJCAI’95: PROCEEDINGS INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1995
"... In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violat ..."
Abstract
-
Cited by 331 (42 self)
- Add to MetaCart
In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint
HOLISTIC SCHEDULABILITY ANALYSIS FOR DISTRIBUTED HARD REAL-TIME SYSTEMS
"... This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines commu ..."
Abstract
-
Cited by 308 (7 self)
- Add to MetaCart
This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines
ROAMing Terrain: Real-time Optimally Adapting Meshes
, 1997
"... Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, view-depend ..."
Abstract
-
Cited by 287 (10 self)
- Add to MetaCart
-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from preprocessed bintree triangles. We introduce two
Power Conscious Fixed Priority Scheduling for Hard Real-Time Systems
, 1999
"... Power efficient design of real-time systems based on programmable processors becomes more important as system functionality is increasingly realized through software. This paper presents a powerefficient version of a widely used fixed priority scheduling method. The method yields a power reduction b ..."
Abstract
-
Cited by 200 (5 self)
- Add to MetaCart
Power efficient design of real-time systems based on programmable processors becomes more important as system functionality is increasingly realized through software. This paper presents a powerefficient version of a widely used fixed priority scheduling method. The method yields a power reduction
Results 1 - 10
of
1,595
