3625 search results - page 349 / 725 » On choosing |
192
click to vote
SSS
2007
Springer
16 years 1 months ago
2007
Springer
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
214
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
215
click to vote
SUM
2007
Springer
16 years 1 months ago
2007
Springer
Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, sev...
194
click to vote
TARK
2007
Springer
16 years 1 months ago
2007
Springer
In Alternating-time Temporal Logic (atl), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: “agent i ca...
163
click to vote
TARK
2007
Springer
16 years 1 months ago
2007
Springer
A classical result in voting theory, the Gibbard-Satterthwaite Theorem, states that for any non-dictatorial voting rule for choosing between three or more candidates, there will b...