10051 search results - page 342 / 2011 » A Dynamic Separator Algorithm |
185
click to vote
ICCTA
2007
IEEE
16 years 1 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
171
click to vote
SPAA
2006
ACM
16 years 25 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
166
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
198
click to vote
ISCC
2000
IEEE
15 years 11 months ago
2000
IEEE
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
205
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...