2996 search results - page 108 / 600 » Numberings and Randomness |
136
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
135
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
119
click to vote
CPC
2008
15 years 5 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
146
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
134
click to vote
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...