413 search results - page 24 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
114
click to vote
DSOM
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
137
click to vote
ENTCS
2007
15 years 28 days ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
114
click to vote
EWSN
2004
Springer
16 years 29 days ago
2004
Springer
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
119
click to vote
QOSIP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
135
click to vote
TON
2008
15 years 1 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...