389 search results - page 64 / 78 » Some natural decision problems in automatic graphs |
ACTA
2006
13 years 6 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
PPL
2000
13 years 6 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
IWCMC
2006
ACM
14 years 21 days ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
CADE
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
INFOCOM
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....