1578 search results - page 147 / 316 » Direct Routing: Algorithms and Complexity |
ACTA
2007
13 years 9 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
SIGACT
2010
13 years 7 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
ICPADS
2007
IEEE
14 years 3 months ago
2007
IEEE
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
DEBS
2008
ACM
13 years 10 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 ...