4110 search results - page 40 / 822 » Efficient algorithms for the 2-gathering problem |
125
Voted
CCE
2004
15 years 3 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
133
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
149
Voted
FLAIRS
2004
15 years 5 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
101
Voted
COLING
1994
15 years 5 months ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
113
Voted
AINA
2008
IEEE
15 years 5 months ago
2008
IEEE
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...