1120 search results - page 88 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
IPCO
2001
13 years 10 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
NPC
2005
Springer
14 years 2 months ago
2005
Springer
With the rapid advances in Internet and Grid technique, an increasing number of applications will involve computing systems. These applications in turn create an increasing demand ...
ISCA
2000
IEEE
14 years 1 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
GECCO
2006
Springer
14 years 29 days ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...