23413 search results - page 4543 / 4683 » or 2005 |
179
click to vote
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
185
click to vote
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
203
Voted
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
214
Voted
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
155
click to vote
WDAG
2005
Springer
16 years 15 days ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...