66 search results - page 2 / 14 » Theoretic study of distributed graph planning |
ICANN
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
COCOON
2005
Springer
14 years 7 days ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
PPAM
2005
Springer
14 years 5 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
WDAG
2005
Springer
14 years 5 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...