Sciweavers

2110 search results - page 101 / 422
» What is the complexity of a distributed computing system
Sort
View
ATAL
2003
Springer
15 years 9 months ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu
HICSS
2003
IEEE
145views Biometrics» more  HICSS 2003»
15 years 9 months ago
The DISCIPLE System for Collaboration over the Heterogeneous Web
With the proliferation of mobile devices we witness an increasing demand for supporting collaboration among users working in the field and in the office. A key component for colla...
Allan Meng Krebs, Mihail F. Ionescu, Bogdan Doroho...
SPAA
2009
ACM
16 years 5 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
ACL
2009
15 years 2 months ago
Distributional Representations for Handling Sparsity in Supervised Sequence-Labeling
Supervised sequence-labeling systems in natural language processing often suffer from data sparsity because they use word types as features in their prediction tasks. Consequently...
Fei Huang, Alexander Yates
DC
2010
15 years 4 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride