Sciweavers

736 search results - page 83 / 148
» Confidence-Aware Join Algorithms
Sort
View
ECSQARU
2003
Springer
14 years 3 months ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
APNOMS
2006
Springer
14 years 1 months ago
"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
Mourad Amad, Ahmed Meddahi
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 5 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
MAAMAW
1993
Springer
14 years 2 months ago
Coalition Formation Among Autonomous Agents: Strategies and Complexity
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
Onn Shehory, Sarit Kraus
VLDB
1994
ACM
137views Database» more  VLDB 1994»
14 years 2 months ago
Performance of Data-Parallel Spatial Operations
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
Erik G. Hoel, Hanan Samet