Sciweavers

475 search results - page 20 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
AIPS
2003
13 years 9 months ago
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
Thomas Schwarzfischer
IPPS
2010
IEEE
13 years 5 months ago
Distributed advance network reservation with delay guarantees
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...
Niloofar Fazlollahi, David Starobinski
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
14 years 1 months ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...
MOBIHOC
2007
ACM
14 years 7 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
CDC
2009
IEEE
141views Control Systems» more  CDC 2009»
13 years 5 months ago
Cell design in bacteria as a convex optimization problem
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
Anne Goelzer, Vincent Fromion, Gérard Scorl...