標(biāo)題: Titlebook: Computational Collective Intelligence. Technologies and Applications; 4th International Co Ngoc-Thanh Nguyen,Kiem Hoang,Piotr J?drzejowicz [打印本頁] 作者: FAULT 時(shí)間: 2025-3-21 19:25
書目名稱Computational Collective Intelligence. Technologies and Applications影響因子(影響力)
書目名稱Computational Collective Intelligence. Technologies and Applications影響因子(影響力)學(xué)科排名
書目名稱Computational Collective Intelligence. Technologies and Applications網(wǎng)絡(luò)公開度
書目名稱Computational Collective Intelligence. Technologies and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Collective Intelligence. Technologies and Applications被引頻次
書目名稱Computational Collective Intelligence. Technologies and Applications被引頻次學(xué)科排名
書目名稱Computational Collective Intelligence. Technologies and Applications年度引用
書目名稱Computational Collective Intelligence. Technologies and Applications年度引用學(xué)科排名
書目名稱Computational Collective Intelligence. Technologies and Applications讀者反饋
書目名稱Computational Collective Intelligence. Technologies and Applications讀者反饋學(xué)科排名
作者: APNEA 時(shí)間: 2025-3-22 00:04 作者: PANEL 時(shí)間: 2025-3-22 02:40 作者: Autobiography 時(shí)間: 2025-3-22 06:26 作者: condemn 時(shí)間: 2025-3-22 09:22 作者: UNT 時(shí)間: 2025-3-22 15:56
Ontology Relation Alignment Based on Attribute Semanticsork [8]) can be defined as explicit specification of decomposition of some part of reality. This specification spreads over three levels of detail: the concept attribute level, the concept level and the relation level. This paper concentrates on identifying matches between relations of concepts whic作者: UNT 時(shí)間: 2025-3-22 19:00 作者: 翅膀拍動 時(shí)間: 2025-3-22 23:46
Applying MapReduce Framework to Peer-to-Peer Computing Applicationsly operate on dedicated clusters of workstations to achieve high performance. However, the dedicated clusters can be unrealistic for users who infrequently have a demand of solving large distributed problems. This paper presents an approach of applying the MapReduce framework on peer-to-peer (P2P) n作者: ferment 時(shí)間: 2025-3-23 02:15 作者: 合同 時(shí)間: 2025-3-23 06:01 作者: 酷熱 時(shí)間: 2025-3-23 13:34
Construction of Semantic User Profile for Personalized Web Search depends on how to model the user details to construct user profile. Previously, user profile was constructed by collecting list of keywords to inferring user interests. These kinds of approaches are not sufficient for many applications. In this paper, we have proposed a new method for constructing 作者: 大氣層 時(shí)間: 2025-3-23 14:46
Link Prediction in Dynamic Networks of Services Emerging during Deployment and Execution of Web Servtures reflecting the patterns according to which the services interact during execution of composition and execution queries. We show how to create so-called networks of Web services which allow to effectively use the network structural analysis and optimization techniques to solve the network compo作者: travail 時(shí)間: 2025-3-23 19:33 作者: MEET 時(shí)間: 2025-3-23 22:19 作者: Neutropenia 時(shí)間: 2025-3-24 04:47 作者: Virtues 時(shí)間: 2025-3-24 08:55 作者: Nonconformist 時(shí)間: 2025-3-24 12:39
Ordering of Potential Collaboration Optionsfirm. Some collaboration options for a firm are first evaluated by experts on previously agreed upon criteria. Methods from rough set theory are afterwords employed for ordering of the agreed upon criteria with respect to their significance in predicting collaboration outcomes.作者: sterilization 時(shí)間: 2025-3-24 14:59
Interface Design for Decision Systemsterature is replete with discussion about what these facets ought to be. The essential ones involve the decision model, agents to handle task distribution and completion, data, solvers that execute model instances, visualization, and scenario development to explore problem instances. The interaction作者: NUL 時(shí)間: 2025-3-24 22:25 作者: 有抱負(fù)者 時(shí)間: 2025-3-25 00:48
J. L. Alonso,J. C. Lopez,D. G. Listeray be huge, and second, processing of the adaptation rules per single user requires computing resources that multiply with the number of users..This paper reports on the efficiency of the method enabling a client-side adaptation after moving adaptation logics from a server to a client.作者: 共和國 時(shí)間: 2025-3-25 07:15
https://doi.org/10.1007/978-1-4899-1615-0pment phases. In particular, the testing and debugging phases, more precisely, how to chose those tests more suitable to be applied, is simplified since tests are automatically extracted from the specification.作者: 內(nèi)部 時(shí)間: 2025-3-25 08:38
https://doi.org/10.1007/978-3-8349-9809-5 with the Share-Per-Link(SPL) architecture where partial wavelength converters are distributed at each output port. A continuous-time Markov chain model is proposed to analyze the performance of OBS core nodes operated with the deflection routing rule.作者: 拖網(wǎng) 時(shí)間: 2025-3-25 14:04 作者: Celiac-Plexus 時(shí)間: 2025-3-25 19:29
OCE: An Online Colaborative Editorpment phases. In particular, the testing and debugging phases, more precisely, how to chose those tests more suitable to be applied, is simplified since tests are automatically extracted from the specification.作者: 殘酷的地方 時(shí)間: 2025-3-25 23:55 作者: 刺穿 時(shí)間: 2025-3-26 01:25
0302-9743 proceedings of the 4th International Conference on Computational Collective Intelligence, ICCCI, held in Ho Chi Minh City, Vietnam, in November 2012..The 113 revised full papers presented were carefully reviewed and selected from 397 submissions. The papers are organized in topical sections on (Par作者: 保守黨 時(shí)間: 2025-3-26 06:06
Tarski, Truth, and Natural Languages of current database size. Therefore, we propose an Efficient Frequent Pattern Mining Model (EFP-M2) to mine the frequent patterns in timely manner. The result shows that the algorithm in EFP-M2l is outperformed at least at 2 orders of magnitudes against the benchmarked FP-Growth.作者: 可商量 時(shí)間: 2025-3-26 11:55 作者: BRIDE 時(shí)間: 2025-3-26 12:56
EFP-M2: Efficient Model for Mining Frequent Patterns in Transactional Database of current database size. Therefore, we propose an Efficient Frequent Pattern Mining Model (EFP-M2) to mine the frequent patterns in timely manner. The result shows that the algorithm in EFP-M2l is outperformed at least at 2 orders of magnitudes against the benchmarked FP-Growth.作者: 以煙熏消毒 時(shí)間: 2025-3-26 18:52 作者: 饒舌的人 時(shí)間: 2025-3-26 23:18 作者: 不適 時(shí)間: 2025-3-27 05:09 作者: 畫布 時(shí)間: 2025-3-27 08:34
,The Wrapped Dimension of Bourbaki’s ,tudy carries out transposition accomplished in printed music notation and in Braille music notation. It is shown that semantic analysis is necessary to transpose in Braille music notation and makes transposition clearer and easier in printed music notation.作者: ornithology 時(shí)間: 2025-3-27 11:56 作者: textile 時(shí)間: 2025-3-27 14:59 作者: 有毒 時(shí)間: 2025-3-27 21:22 作者: Thyroid-Gland 時(shí)間: 2025-3-28 00:42 作者: 殘廢的火焰 時(shí)間: 2025-3-28 03:27
Shyamalava Mazumdar,Samaresh Mitratain contributing computing resources, forming computing groups and executing the MapReduce operations. The performance evaluation of the system has been compared with the Hadoop cluster using the prevailing word count problem.作者: 是貪求 時(shí)間: 2025-3-28 08:51 作者: 開始從未 時(shí)間: 2025-3-28 13:17 作者: 裂隙 時(shí)間: 2025-3-28 18:18 作者: myopia 時(shí)間: 2025-3-28 21:25
Data Deduplication Using Dynamic Chunking Algorithm chunking. In experiment result, the proposed dynamic chunking results in significant performance improvement for deduplication processing capability and shows fast processing time comparable to that of fixed length chunking.作者: 易于 時(shí)間: 2025-3-29 00:28 作者: Hippocampus 時(shí)間: 2025-3-29 05:19
Link Prediction in Dynamic Networks of Services Emerging during Deployment and Execution of Web Servysis may help to assess the future service usage and resource consumption of the service execution layer. Our approach is illustrated by the real data gathered from the . platform, dedicated to the complex service planning, management, provision, composition, execution and validation.作者: Graves’-disease 時(shí)間: 2025-3-29 07:47
Short-Term Spatio-temporal Forecasts of Web Performance by Means of Turning Bands Methodl analyses of the measurement data were performed. Then short-term spatio-temporal forecasts of total downloading times for a four days ahead were made. And finally, thorough analysis of the obtained results was carried out and further research directions were proposed.作者: 羊欄 時(shí)間: 2025-3-29 13:04
Conference proceedings 2012ntelligent decision making; methods for scheduling; collective intelligence in web systems – web systems analysis; advanced data mining techniques and applications; cooperative problem solving; computational swarm intelligence; and semantic methods for knowledge discovery and communication.?.作者: CHIP 時(shí)間: 2025-3-29 17:18 作者: 先驅(qū) 時(shí)間: 2025-3-29 21:48 作者: 青少年 時(shí)間: 2025-3-30 01:22
Ngoc-Thanh Nguyen,Kiem Hoang,Piotr J?drzejowiczUp-to-date results.Fast track conference proceedings.State-of-the-art report作者: 慎重 時(shí)間: 2025-3-30 07:58 作者: 紅潤 時(shí)間: 2025-3-30 08:56
Computational Collective Intelligence. Technologies and Applications978-3-642-34707-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: pellagra 時(shí)間: 2025-3-30 14:26 作者: mechanical 時(shí)間: 2025-3-30 19:59
Organizations as Social Systems,firm. Some collaboration options for a firm are first evaluated by experts on previously agreed upon criteria. Methods from rough set theory are afterwords employed for ordering of the agreed upon criteria with respect to their significance in predicting collaboration outcomes.作者: 土坯 時(shí)間: 2025-3-30 23:08 作者: Meander 時(shí)間: 2025-3-31 01:52 作者: 輕信 時(shí)間: 2025-3-31 07:04
Shock Waves and Related Equations of State, volume of historically collected data. Meanwhile, a recent trend in data communities has been the presence of dynamic, interdisciplinary data communities in which users can find and select data from a wide range of data providers. Using this approach, we have designed the Cubing service platform, w作者: 大門在匯總 時(shí)間: 2025-3-31 11:39 作者: 艱苦地移動 時(shí)間: 2025-3-31 16:30 作者: ADJ 時(shí)間: 2025-3-31 20:08
Formal Semantics, Geometry, and Mindter allows to eliminate error fluctuations during data projection. Calculating distances not for all data points but for the part of them results in important reduction of the calculation time without worsening the final results. The third improvement allows adding new data to the projected ones wit作者: landmark 時(shí)間: 2025-3-31 23:12 作者: Ballad 時(shí)間: 2025-4-1 03:49 作者: 走調(diào) 時(shí)間: 2025-4-1 08:26
Shyamalava Mazumdar,Samaresh Mitraly operate on dedicated clusters of workstations to achieve high performance. However, the dedicated clusters can be unrealistic for users who infrequently have a demand of solving large distributed problems. This paper presents an approach of applying the MapReduce framework on peer-to-peer (P2P) n
