540 search results - page 42 / 108 » Competitive Routing over Time |
NETCOOP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Modeling the competition among telecommunication operators (or providers) as a repeated game may explain why tacit collusion to maintain high charging prices can be obser...
APIN
2004
13 years 10 months ago
2004
A rough self-organizing map (RSOM) with fuzzy discretization of feature space is described here. Discernibility reducts obtained using rough set theory are used to extract domain k...
ICFEM
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We develop a way of analyzing the behavior of systems modeled using Discrete Time Markov Chains (DTMC). Specifically, we define iLTL, an LTL with linear inequalities on...
IFIPTCS
2010
13 years 8 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...