104 search results - page 12 / 21 » Graph Searching, Elimination Trees, and a Generalization of ... |
75
Voted
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
113
click to vote
SIGMOD
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
60
Voted
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
108
click to vote
SAC
2011
ACM
14 years 12 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...