6251 search results - page 1095 / 1251 » Randomness, Computability, and Density |
170
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
122
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
114
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
143
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
128
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...