標(biāo)題: Titlebook: High Performance Computing Systems and Applications; Nikitas J. Dimopoulos,Kin F. Li Book 2002 Springer Science+Business Media New York 20 [打印本頁] 作者: Deleterious 時(shí)間: 2025-3-21 20:02
書目名稱High Performance Computing Systems and Applications影響因子(影響力)
書目名稱High Performance Computing Systems and Applications影響因子(影響力)學(xué)科排名
書目名稱High Performance Computing Systems and Applications網(wǎng)絡(luò)公開度
書目名稱High Performance Computing Systems and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱High Performance Computing Systems and Applications被引頻次
書目名稱High Performance Computing Systems and Applications被引頻次學(xué)科排名
書目名稱High Performance Computing Systems and Applications年度引用
書目名稱High Performance Computing Systems and Applications年度引用學(xué)科排名
書目名稱High Performance Computing Systems and Applications讀者反饋
書目名稱High Performance Computing Systems and Applications讀者反饋學(xué)科排名
作者: FLOUR 時(shí)間: 2025-3-21 22:31
High Performance Computing Systems and Applications978-1-4615-0849-6Series ISSN 0893-3405 作者: 拋射物 時(shí)間: 2025-3-22 03:20
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/h/image/426322.jpg作者: 釘牢 時(shí)間: 2025-3-22 07:53 作者: 代替 時(shí)間: 2025-3-22 11:03 作者: pulse-pressure 時(shí)間: 2025-3-22 16:30 作者: Nuance 時(shí)間: 2025-3-22 17:44
A Mobile Agent-Based Approach to Web-Based Distributed Computingagent-based architecture to effectively harness the power of the World Wide Web as a global computing platform. The resulting system provides the end-user with a simpler agent-based means for utilizing the power of the Web as a computing resource.作者: 向下 時(shí)間: 2025-3-22 23:39 作者: corn732 時(shí)間: 2025-3-23 04:53 作者: cortex 時(shí)間: 2025-3-23 05:56 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-23 11:12 作者: 察覺 時(shí)間: 2025-3-23 16:02 作者: Infuriate 時(shí)間: 2025-3-23 20:15
S. Dost,R. A. Meric,B. Lent,R. F. Redden constituted through selections of plugins providing specialized functionality for multiple platforms. In this manner the . family constitutes a product line architecture. . is available free of charge including the Java source code. In this contribution we provide information about .’s functionalit作者: 極小 時(shí)間: 2025-3-24 01:02 作者: 辮子帶來幫助 時(shí)間: 2025-3-24 06:18 作者: grudging 時(shí)間: 2025-3-24 08:26 作者: incite 時(shí)間: 2025-3-24 14:02 作者: Gnrh670 時(shí)間: 2025-3-24 15:50 作者: defibrillator 時(shí)間: 2025-3-24 22:54 作者: Carbon-Monoxide 時(shí)間: 2025-3-25 01:44 作者: Ergots 時(shí)間: 2025-3-25 03:34 作者: RENIN 時(shí)間: 2025-3-25 07:53 作者: 特別容易碎 時(shí)間: 2025-3-25 11:58
Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Trafficunicast (or point-to-point) traffic. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the effect of collective communication algorithms on the network作者: RENAL 時(shí)間: 2025-3-25 16:42 作者: 圣人 時(shí)間: 2025-3-25 22:57
Analysis of Frame-Based Fair Queueing under Self-Similar Trafficueing (FFQ), a scheduling algorithm for packet switched networks, has been proposed. The algorithm has O(1) timestamp computation complexity. This makes the algorithm more practical for implementation in both general packet networks with variable packet sizes and in asynchronous transfer mode (ATM) 作者: 合適 時(shí)間: 2025-3-26 02:00
Reducing Cache Miss Penalty Using I-Fetch Instructionsgives information of next basic block to be fetched. It is recognized by processor without decoding, and is processed in parallel with the other types of instructions. It is also used as the special instruction to prefech instructions. We call it the i-fetch instruction. Our simulation result shows 作者: 助記 時(shí)間: 2025-3-26 06:29 作者: Fatten 時(shí)間: 2025-3-26 10:40
odel represents causal memory of the players, which are tokens on a Petri net and divided into two teams: the controllable system and the uncontrollable environment. For one environment player and a bounded number of system players, the problem of solving Petri games can be reduced to that of solvin作者: stress-test 時(shí)間: 2025-3-26 14:58 作者: refine 時(shí)間: 2025-3-26 20:50 作者: 無意 時(shí)間: 2025-3-26 22:37 作者: Fillet,Filet 時(shí)間: 2025-3-27 03:23 作者: 音樂戲劇 時(shí)間: 2025-3-27 08:42
Klaus Krauter,Muthucumaru Maheswaransibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose . as the framework of their thesis project), by now . became an analysis platform, providing various cutting-edge model checking algorithms and st作者: Isometric 時(shí)間: 2025-3-27 12:29 作者: 河流 時(shí)間: 2025-3-27 14:21 作者: 清醒 時(shí)間: 2025-3-27 20:31
Randy Fortier,Robert D. Kentl-based method in the context of health management of hybrid systems. In system health management, the diagnosis task aims at determining the current health state of a system and the fault occurrences that lead to this state. The Hybrid Particle Petri Nets (HPPN) formalism is used to model hybrid sy作者: Arthritis 時(shí)間: 2025-3-28 00:05 作者: 啪心兒跳動(dòng) 時(shí)間: 2025-3-28 05:37 作者: 毛細(xì)血管 時(shí)間: 2025-3-28 08:35
S. Dost,R. A. Meric,B. Lent,R. F. Reddenechniques. The Reference net formalism – the major formalism for . – includes concepts such as net instances, synchronous channels and seamless Java integration. It combines the advantages of Petri nets and object-oriented programming for the development of concurrent and distributed software system作者: Genetics 時(shí)間: 2025-3-28 11:34
E. Q. Hu,M. Fujii,P. P. M. So,W. Liu,J. W. Park,W. J. R. Hoefery: the Borel and Wadge hierarchies of the class of .-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of .-languages of (non-deterministic) Turing machines. We also show that it is highly undecidable to determine the topological complexity of a Pe作者: 刪除 時(shí)間: 2025-3-28 18:35 作者: 惰性氣體 時(shí)間: 2025-3-28 21:06
A. Shahrabi,L. M. Mackenzie,M. Ould-Khaouaponents. We develop an algorithm for deciding the winner of the game and suggest a notion of alternating simulation in order to speed up the computation of the winning strategy. The theory is applied to Petri net games, where the strictly alternating games are in general undecidable. We consider sof作者: 陶醉 時(shí)間: 2025-3-29 00:17 作者: 反話 時(shí)間: 2025-3-29 05:35
Hossam Fattah,Fayez Elguibalye use tools from the theory of nonexpansive mappings to analyze these systems. We establish an equivalence theorem between priority-free fluid timed Petri nets and semi-Markov decision processes, from which we derive the convergence to a periodic regime and the polynomial-time computability of the t作者: 丑惡 時(shí)間: 2025-3-29 07:48 作者: nostrum 時(shí)間: 2025-3-29 13:13
Shusuke Okamoto,Takata Kazuyoshidevelopment of credit risk management can improve the competitiveness of European banks and financial institutions. The necessity of more accurate credit risk modeling motivates researchers to discover new methods in credit assessment.作者: CONE 時(shí)間: 2025-3-29 18:19
Yul Chu,M. R. Itodevelopment of credit risk management can improve the competitiveness of European banks and financial institutions. The necessity of more accurate credit risk modeling motivates researchers to discover new methods in credit assessment.作者: 脫離 時(shí)間: 2025-3-29 20:52
A Dynamic Scheme in Support of Scalability in General Purpose Distributed Virtual Environmentsroach to scaling applicable to any Distributed Virtual Environment. In this paper we report on progress made in design and implementation of a scalable DVE application based on dynamical weighted binary partitioning and multicast groups.作者: cancer 時(shí)間: 2025-3-30 00:53
