Sciweavers

5699 search results - page 210 / 1140
» Alternating model trees
Sort
View
AAAI
2008
15 years 8 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
ICDCS
2006
IEEE
16 years 4 days ago
Overlay Multicast with Inferred Link Capacity Correlations
We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree...
Ying Zhu, Baochun Li
TSP
2008
76views more  TSP 2008»
15 years 6 months ago
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks
We consider the problem of decentralized detection in failure-prone tree networks with bounded height. Specifically, we study and contrast the impact on the detection performance o...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
PVM
2010
Springer
15 years 4 months ago
Two Algorithms of Irregular Scatter/Gather Operations for Heterogeneous Platforms
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
Kiril Dichev, Vladimir Rychkov, Alexey L. Lastovet...
FUIN
2010
172views more  FUIN 2010»
15 years 3 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...