721 search results - page 142 / 145 » Bounds on the k-domination number of a graph |
TACAS
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
MOBICOM
2003
ACM
14 years 20 days ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
SIGMOD
2010
ACM
14 years 7 days ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
SPAA
1999
ACM
13 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...