581 search results - page 106 / 117 » Approximation algorithms for constructing wavelength routing... |
108
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
166
click to vote
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
116
click to vote
MOBIHOC
2005
ACM
16 years 28 days ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
116
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 2 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
119
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...