447 search results - page 55 / 90 » Decision trees with minimal costs |
ESA
2008
Springer
13 years 10 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
AINA
2007
IEEE
14 years 3 months ago
2007
IEEE
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Manycast is a group communication primitive wherein the source is required to send data packets to a certain number of a given set of destinations. In this article, we design faul...