6598 search results - page 1261 / 1320 » Graph Theory with Applications |
122
click to vote
SPAA
2009
ACM
15 years 11 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...
121
click to vote
ICC
2009
IEEE
15 years 11 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...
136
Voted
INFOCOM
2009
IEEE
15 years 10 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...
157
click to vote
WOLLIC
2009
Springer
15 years 10 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...
109
click to vote
ATAL
2009
Springer
15 years 10 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...