Sciweavers

1480 search results - page 272 / 296
» Robust cost colorings
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered i...
Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsu...
ACL
1992
13 years 8 months ago
SEXTANT: Exploring Unexplored Contexts for Semantic Extraction from Syntactic Analysis
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
Gregory Grefenstette
MOBICOM
2010
ACM
13 years 7 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
Salah A. Aly, Ahmed E. Kamal
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 7 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen