13214 search results - page 2297 / 2643 » Pseudorandomness for network algorithms |
172
click to vote
HSNMC
2004
Springer
16 years 6 days ago
2004
Springer
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
159
click to vote
HUC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. NearMe is a server, algorithms, and application programming interfaces (APIs) for clients equipped with 802.11 wireless networking (Wi-Fi) to compute lists of people and ...
202
click to vote
ICFEM
2004
Springer
16 years 6 days 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...
172
Voted
IFIP
2004
Springer
16 years 6 days ago
2004
Springer
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
178
click to vote
MFCS
2004
Springer
16 years 5 days ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...