15 search results - page 3 / 3 » Abduction with Bounded Treewidth: From Theoretical Tractabil... |
IEEEPACT
1998
IEEE
14 years 23 days ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
MOBIHOC
2004
ACM
14 years 8 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
DCOSS
2006
Springer
14 years 6 days ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
ICTAI
2009
IEEE
13 years 6 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...