3958 search results - page 83 / 792 » Dynamic Graph Algorithms with Applications |
169
click to vote
P2PKM
2004
15 years 6 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
126
click to vote
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
161
Voted
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Evolutionary Testing (ET) has been shown to be very successful for testing real world applications [10]. The original ET approach focusesonsearching for a high coverage of the test...
136
click to vote
PVLDB
2010
15 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
149
click to vote
IAT
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...