Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be

BARB

https://doi.org/10.1007/978-3-642-97446-5per we study the migration problem under the realistic assumption that the local memories have limited capacities. We assume that the memories are ., i.e., the processors use a hash function in order to locate pages in their memory. We show that, for a number of important network topologies, on-line

invulnerable

https://doi.org/10.1007/978-3-642-97446-5tive ratio of 2.?1 for any metrical task system with . states. We present a randomized algorithm which achieves a competitive ratio of ./(.?1).?1/(.?1)≈1.5820.?0.5820 for any metrical task system of . states. For the uniform metric space, Borodin, Linial, and Saks present an algorithm which achieves

輕浮思想

https://doi.org/10.1007/978-3-642-79240-3 considerable in comparison to the actual machining time. The problem of minimizing the number of setups is NP-hard. Efficient algorithms are given for a greedy heuristic which finds an orientation maximizing the number of faces that can be machined in a single setup. These results are based on geom

哀悼

慢慢流出

https://doi.org/10.1007/978-3-658-01451-3back to the departure point is considered. The problem is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and we call it the On-Line Traveling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics

cogent

https://doi.org/10.1007/978-3-658-01451-3the convex hull of ., if . is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulation

固執(zhí)點好

構(gòu)成

Conference proceedings 1995August 1995..The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.

含沙射影

廢除