42 search results - page 8 / 9 » Using Lower Bounds During Dynamic BDD Minimization |
DEBS
2008
ACM
13 years 6 months ago
2008
ACM
In this effort we tackle the important issue of providing Quality of Service (QoS) guarantees to subscribers, when routing event notifications in a publish-subscribe domain. In ...
AIPS
2010
13 years 7 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
DCOSS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
USENIX
2008
13 years 7 months ago
2008
zation is a well-known method of abstracting physical resources and of separating the manipulation and use of logical resources from their underlying implementation. We have used ...
VLDB
1998
ACM
13 years 9 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...