395 search results - page 28 / 79 » Optimizing Communication Scheduling Using Dataflow Semantics |
APPROX
2006
Springer
14 years 25 days ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Sensor networks with a large amount of sensor nodes usually have high redundancy in sensing coverage. The network lifetime can be further extended by proper scheduling and putt...
CASES
2000
ACM
14 years 1 months ago
2000
ACM
In this paper, we describe a software architecture supporting code generation from within Ptolemy II. Ptolemy II is a componentbased design tool intended for embedded and real-tim...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...