108 search results - page 15 / 22 » Valuing search and communication in partially-observable coo... |
SIGCOMM
2012
ACM
11 years 9 months ago
2012
ACM
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
MICAI
2000
Springer
13 years 11 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
We consider a problem where two selfish cognitive radio users try to share two channels on which they each have potentially different valuations. We first formulate the problem as ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...