Titlebook: Parallel and Distributed Processing and Applications; 5th International Sy Ivan Stojmenovic,Ruppa K. Thulasiram,Rodrigo Ferna Conference pr

Colossal

書目名稱Parallel and Distributed Processing and Applications影響因子(影響力)




書目名稱Parallel and Distributed Processing and Applications影響因子(影響力)學(xué)科排名




書目名稱Parallel and Distributed Processing and Applications網(wǎng)絡(luò)公開度




書目名稱Parallel and Distributed Processing and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Parallel and Distributed Processing and Applications被引頻次




書目名稱Parallel and Distributed Processing and Applications被引頻次學(xué)科排名




書目名稱Parallel and Distributed Processing and Applications年度引用




書目名稱Parallel and Distributed Processing and Applications年度引用學(xué)科排名




書目名稱Parallel and Distributed Processing and Applications讀者反饋




書目名稱Parallel and Distributed Processing and Applications讀者反饋學(xué)科排名

用樹皮

Feature Extraction and Coverage Problems in Distributed Sensor Networks talk presents some new results on the following topics: 1) An optimization framework based on mathematical programming for maximizing the coverage probability of a sensor field under the constraints of investment limit; 2) Feature extraction using sensor networks.

燕麥

Oafishness

同義聯(lián)想法

Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison We assume that the partitioning strategy is used to allocate the tasks to the processors and the EDF method is used to schedule the tasks on each processor. It is known that this scenario is NP-hard; thus, it is unlikely to find a polynomial time algorithm to schedule the tasks on the minimum numbe

衰老

Architecture-Based Optimization for Mapping Scientific Applications to Imaginearchitecture-based optimization for the key techniques of mapping scientific applications to Imagine. Our specific contributions include that we achieve fine kernel granularity and choose necessary arrays to organize appropriate streams. Specially, we develop a new stream program generation algorith

infelicitous

啟發(fā)

A Mutual Exclusion Algorithm for Mobile Agents-Based Applications the their behaviours is hard. We concentrate on the mutual exclusion issue in this paper and propose an algorithm for achieving mutex among mobile agents. In contrast to the existing algorithms for traditional distributed processes, the proposed algorithm does not require MAs to have a pre-knowledg

Exonerate

Ambiguous