Sciweavers

112 search results - page 15 / 23
» Searching Game Trees in Parallel Using SSS
Sort
View
CORR
2008
Springer
167views Education» more  CORR 2008»
14 years 9 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
SPAA
1990
ACM
15 years 1 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
ATAL
2005
Springer
15 years 3 months ago
Modeling complex multi-issue negotiations using utility graphs
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 ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
AAAI
1990
14 years 11 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
IPPS
2007
IEEE
15 years 4 months ago
Dynamic Load Balancing of Unbalanced Computations Using Message Passing
This paper examines MPI’s ability to support continuous, dynamic load balancing for unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to compare...
James Dinan, Stephen Olivier, Gerald Sabin, Jan Pr...