Titlebook: Algorithms and Computation; 9th International Sy Kyung-Yong Chwa,Oscar H. Ibarra Conference proceedings 1998 Springer-Verlag Berlin Heidelb

choleric

书目名称Algorithms and Computation影响因子(影响力)




书目名称Algorithms and Computation影响因子(影响力)学科排名




书目名称Algorithms and Computation网络公开度




书目名称Algorithms and Computation网络公开度学科排名




书目名称Algorithms and Computation被引频次




书目名称Algorithms and Computation被引频次学科排名




书目名称Algorithms and Computation年度引用




书目名称Algorithms and Computation年度引用学科排名




书目名称Algorithms and Computation读者反馈




书目名称Algorithms and Computation读者反馈学科排名

Comprise

做作

On-Line Scheduling of Parallel Jobs with Runtime Restrictionsing algorithms for various interconnection topologies that use some a priori information about the job running times or guarantee a good competitive ratio that depends on the runtime ratio of all generated jobs. All algorithms presented in this paper have optimal competitive ratio up to small additive constants.

Ballerina

积习已深

抛弃的货物

Ausblick: Theoretische Implikationenrnative. Using the .. Voronoi diagram of polygons we address the problem of calculating the . for shorts in a VLSI layout. The critical area computation is the main computational problem in VLSI yield prediction.

Coeval

小溪

palliative-care

paltry

Konsumsoziologie und Massenkulturn of an mage as a collection of contour lines for ntensitylevels this problem is naturally defined as one of reconnect ng those contour lines disconnected by a flaw region. An efficient algorithm for reconnecting contour lines is presented based on perfect matching and observations on geometric properties of interconnection paths.