Sciweavers

777 search results - page 17 / 156
» The Refined Process Structure Tree
Sort
View
DC
2010
14 years 11 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
15 years 5 months ago
Validating and Refining Clusters via Visual Rendering
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
Keke Chen, Ling Liu
AAAI
2012
13 years 2 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
JGTOOLS
2008
100views more  JGTOOLS 2008»
14 years 11 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
ACL
2008
15 years 1 months ago
Efficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
Michaela Regneri, Markus Egg, Alexander Koller