1002 search results - page 145 / 201 » Towards Graph Programs for Graph Algorithms |
131
Voted
CC
2009
Springer
15 years 7 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
107
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...
132
click to vote
CC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
111
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
106
click to vote
CASES
2007
ACM
15 years 6 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...