2 search results - page 1 / 1 » An Extension of Complexity Bounds and Dynamic Heuristics for... |
CP
2006
Springer
13 years 10 months ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
COMSWARE
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...