Sciweavers

14 search results - page 2 / 3
» Path-Constrained Relaxed Schedulability Analysis
Sort
View
TCOM
2008
74views more  TCOM 2008»
13 years 5 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
CPAIOR
2010
Springer
13 years 10 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
QOFIS
2004
Springer
13 years 11 months ago
Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks
Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can ent...
Konstantinos Oikonomou, Ioannis Stavrakakis
AAAI
1994
13 years 7 months ago
Exploiting Meta-Level information in a Distributed Scheduling System
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 6 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer