91 search results - page 11 / 19 » Discovery and Validation of Queueing Networks in Scheduled P... |
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...
RTAS
2005
IEEE
15 years 4 months ago
2005
IEEE
Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to ...
RECOMB
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Transcriptional interactions in a cell are modulated by a variety of mechanisms that prevent their representation as pure pairwise interactions between a transcription fa...
ETT
2002
14 years 10 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
107
click to vote
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...