475 search results - page 13 / 95 » Feasible distributed CSP models for scheduling problems |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
CP
2006
Springer
13 years 11 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...