1002 search results - page 27 / 201 » Towards Graph Programs for Graph Algorithms |
111
click to vote
OTM
2010
Springer
14 years 11 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
102
click to vote
TSE
2010
15 years 8 days ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
112
click to vote
ESA
1998
Springer
15 years 6 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
155
click to vote
LOGCOM
1998
15 years 1 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...