Sciweavers

166 search results - page 14 / 34
» Monotonicity in Bargaining Networks
Sort
View
TIT
2008
105views more  TIT 2008»
14 years 11 months ago
Network Coding Capacity With a Constrained Number of Coding Nodes
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
Jillian Cannons, Kenneth Zeger
KI
1998
Springer
15 years 4 months ago
From Theory to Practice in Multiagent System Design: The Case of Structural Co-operation
Abstract. In Distributed Problem-solving (DPS) systems a group of purposefully designed computational agents interact and co-ordinate their activities so as to jointly achieve a gl...
Sascha Ossowski, Ana García-Serrano, Jos&ea...
AAAI
2008
15 years 2 months ago
Factored Models for Probabilistic Modal Logic
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
Afsaneh Shirazi, Eyal Amir
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 1 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
INFOCOM
2002
IEEE
15 years 4 months ago
Exact sampling of TCP Window States
We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically ...
Ashish Goel, Michael Mitzenmacher