6598 search results - page 1261 / 1320 » Graph Theory with Applications |
170
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
151
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
177
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
202
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
147
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...