21 search results - page 4 / 5 » Dynamic Programming to Minimize the Maximum Number of Open S... |
AOSD
2007
ACM
13 years 9 months ago
2007
ACM
Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
IEEESCC
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...