8540 search results - page 106 / 1708 » The Dynamic Servers Problem |
DAIS
2003
14 years 11 months ago
2003
- Mobile agents have the ability to migrate through heterogeneous networks and execute at remote hosts. This ability can be exploited to improve the performance of agent based appl...
SIAMCOMP
1998
14 years 9 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Many optimisation problems are multi-objective and change dynamically. Many methods use a weighted average approach to the multiple objectives. This paper introduces the usage ...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...