Sciweavers

5448 search results - page 1003 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SENSYS
2006
ACM
15 years 6 months ago
Run-time dynamic linking for reprogramming wireless sensor networks
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
Adam Dunkels, Niclas Finne, Joakim Eriksson, Thiem...
P2P
2005
IEEE
106views Communications» more  P2P 2005»
15 years 6 months ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
97
Voted
ICALP
2005
Springer
15 years 6 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
98
Voted
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 6 months ago
On the Minimum Load Coloring Problem
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...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
103
Voted
CAISE
2004
Springer
15 years 6 months ago
Network-based Business Process Management: a Discussion on Embedding Business Logic in Communications Networks
Advanced Business Process Management (BPM) tools enable the decomposition of previously integrated and often ill-defined processes into reusable process modules. These process modu...
Louis-François Pau, Peter H. M. Vervest
« Prev « First page 1003 / 1090 Last » Next »