1002 search results - page 28 / 201 » Towards Graph Programs for Graph Algorithms |
111
click to vote
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
179
click to vote
OOPSLA
2000
Springer
15 years 5 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
109
click to vote
PDPTA
2007
15 years 3 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
132
click to vote
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
SKG
2006
IEEE
15 years 8 months ago
2006
IEEE
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...