Sciweavers

4081 search results - page 610 / 817
» Scheduling in polling systems
Sort
View
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 7 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
15 years 7 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
AAMAS
2005
Springer
15 years 7 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
AI
2005
Springer
15 years 7 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
TRANSCI
2008
108views more  TRANSCI 2008»
15 years 7 months ago
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, G...