標(biāo)題: Titlebook: Computer and Information Sciences II; 26th International S Erol Gelenbe,Ricardo Lent,Georgia Sakellari Conference proceedings 2012 Springer [打印本頁] 作者: 使無罪 時間: 2025-3-21 17:55
書目名稱Computer and Information Sciences II影響因子(影響力)
書目名稱Computer and Information Sciences II影響因子(影響力)學(xué)科排名
書目名稱Computer and Information Sciences II網(wǎng)絡(luò)公開度
書目名稱Computer and Information Sciences II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computer and Information Sciences II被引頻次
書目名稱Computer and Information Sciences II被引頻次學(xué)科排名
書目名稱Computer and Information Sciences II年度引用
書目名稱Computer and Information Sciences II年度引用學(xué)科排名
書目名稱Computer and Information Sciences II讀者反饋
書目名稱Computer and Information Sciences II讀者反饋學(xué)科排名
作者: 組裝 時間: 2025-3-22 00:12
Hypergraph-Theoretic Partitioning Models for Parallel Web Crawlingnation scheme in parallel crawling systems is the link exchange scheme, where discovered links are communicated between processors. This scheme can attain the coverage and quality level of a serial crawler while avoiding redundant crawling of pages by different processors. The main problem in the ex作者: 代理人 時間: 2025-3-22 00:49
Web Service Discovery: A Service Oriented, Peer-to-Peer Approach with Categorization on OWL-S. The service discovery and matchmaking is performed via a centralized peer-to-peer web service repository. The repository has the ability to run on a software cloud, which improves the availability and scalability of the service discovery. An OWL-S based unified ontology—Suggested Upper Me作者: theta-waves 時間: 2025-3-22 05:13 作者: correspondent 時間: 2025-3-22 11:57 作者: narcotic 時間: 2025-3-22 13:46
Automatic Categorization of Ottoman Literary Texts by Poet and Time Periodnts much more accessible in various applications ranging from historical investigations to literary analyses. In this work, we use transcribed version of Ottoman literary texts in the Latin alphabet and show that it is possible to develop effective Automatic Text Categorization techniques that can b作者: narcotic 時間: 2025-3-22 17:15 作者: foodstuff 時間: 2025-3-23 00:14
Unsupervised Morphological Analysis Using Trieses in a given dataset. Target languages are English, Finnish, and Turkish, but the algorithm can be used to segment any word from any language given the wordlists acquired from a corpus consisting of words and word occurrences. In each iteration, the algorithm divides words with respect to occurrenc作者: 門閂 時間: 2025-3-23 01:49 作者: 商品 時間: 2025-3-23 05:51 作者: 精致 時間: 2025-3-23 13:34 作者: 收集 時間: 2025-3-23 15:34 作者: airborne 時間: 2025-3-23 19:18 作者: indenture 時間: 2025-3-23 23:51
Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P Networksce criteria like scalability, reliability, fault-tolerance and security. We consider frequent item set discovery problem in this context. Although it has attracted attention due to its extensive applicability in diverse areas, there is no prior work on energy cost model for such distributed protocol作者: Demulcent 時間: 2025-3-24 04:23 作者: Incisor 時間: 2025-3-24 10:07 作者: 審問,審訊 時間: 2025-3-24 14:13 作者: 考博 時間: 2025-3-24 17:43
The Case of Nicholas Black Elk,he wordlists acquired from a corpus consisting of words and word occurrences. In each iteration, the algorithm divides words with respect to occurrences and constructs a new trie for the remaining affixes. Preliminary experimental results on three languages show that our novel algorithm performs better than most of the previous algorithms.作者: 節(jié)省 時間: 2025-3-24 19:02 作者: 單挑 時間: 2025-3-25 02:02 作者: 卡死偷電 時間: 2025-3-25 05:09 作者: 虛弱的神經(jīng) 時間: 2025-3-25 08:04
The Etiology of Atopic Dermatitisthe energy level and increase the lifetime of the whole network, we propose to periodically force the cooperation of less operative nodes while overwhelmed nodes deliberately stop their service. A dedicated ad hoc network routing protocol is introduced to discover alternative paths without losses in the overall network performance.作者: Irksome 時間: 2025-3-25 13:18 作者: 微生物 時間: 2025-3-25 19:46 作者: refine 時間: 2025-3-25 22:10 作者: Kaleidoscope 時間: 2025-3-26 01:51 作者: Fracture 時間: 2025-3-26 04:54
Towards a Fairer Energy Consumption in Wireless Ad hoc Networksthe energy level and increase the lifetime of the whole network, we propose to periodically force the cooperation of less operative nodes while overwhelmed nodes deliberately stop their service. A dedicated ad hoc network routing protocol is introduced to discover alternative paths without losses in the overall network performance.作者: CAMEO 時間: 2025-3-26 12:13
Tony Radspieler B. A., DR. OEC. PUBL.rged Ontology—is used in web service annotation. User-agents generate query specification using the system ontology, to provide semantic unification between the client and the system during service discovery. Query matching is performed via complex Hilbert Spaces composed of conceptual planes and categorical similarities for each web service.作者: 的’ 時間: 2025-3-26 12:53 作者: 誘導(dǎo) 時間: 2025-3-26 19:51
Animal Welfare in Farm Animal Productionturbing balancing constraint. We also propose and investigate assignment schemes that can further reduce communication overheads without disturbing balancing constraints. The conducted experiments indicate promising results.作者: dagger 時間: 2025-3-26 20:57
Animal Welfare in Farm Animal Productionpower of . with heuristic approaches so that we can have a polynomial time approximation algorithm based on a constructive method. . and . algorithms together provide execution plans that are very close to the best performing solutions, and achieve this in polynomial time. This makes our algorithm viable for large multi-way join queries.作者: Accord 時間: 2025-3-27 04:05 作者: MIME 時間: 2025-3-27 05:38
https://doi.org/10.1057/9780230512030ized integration engines. The Search Computing project has the ambitious goal of lowering the technological barrier required for building complex search applications, thereby enabling the development of many new applications which will cover relevant search needs.作者: Credence 時間: 2025-3-27 10:16 作者: pericardium 時間: 2025-3-27 15:26
The Story of Eczema in Pictures,utomated administration. This paper will propose a way of saving energy for IaaS cloud data centre considering all stated constraints. The basic idea is rearranging the allocation in a way that saving energy. The simulation results show the efficiency of the method.作者: 跳脫衣舞的人 時間: 2025-3-27 19:32
Search Computing: Addressing Complex Search on the Web,ized integration engines. The Search Computing project has the ambitious goal of lowering the technological barrier required for building complex search applications, thereby enabling the development of many new applications which will cover relevant search needs.作者: 決定性 時間: 2025-3-28 01:16 作者: Invertebrate 時間: 2025-3-28 05:27
Energy Efficient Resource Allocation Strategy for Cloud Data Centresutomated administration. This paper will propose a way of saving energy for IaaS cloud data centre considering all stated constraints. The basic idea is rearranging the allocation in a way that saving energy. The simulation results show the efficiency of the method.作者: 松軟無力 時間: 2025-3-28 07:13 作者: 令人作嘔 時間: 2025-3-28 13:14 作者: 暴行 時間: 2025-3-28 14:56
Hypergraph-Theoretic Partitioning Models for Parallel Web Crawlingorrectly capture and minimize the number of network messages exchanged between crawlers. We evaluate the performance of our models on four benchmark datasets. Compared to the traditional hash-based assignment approach, significant performance improvements are observed in reducing the inter-processor communication overhead.作者: callous 時間: 2025-3-28 20:31
An Empirical Study About Search-Based Refactoring Using Alternative Multiple and Population-Based Secodes as its input. The empiricial study showed that multiple steepest descent and population-based artificial bee colony algorithms are two most suitable approaches for the efficient solution of the search based refactoring problem.作者: ear-canal 時間: 2025-3-29 00:02 作者: Habituate 時間: 2025-3-29 05:31 作者: 惡名聲 時間: 2025-3-29 11:18
Finding High Order Dependencies in Datasignificant positive dependencies as well as negative ones suitable to identify rare events. The system returns the patterns ranked by . they are guaranteed to be statistically significant and their number results reduced in comparison with other methods.作者: 發(fā)怨言 時間: 2025-3-29 13:37 作者: Diatribe 時間: 2025-3-29 17:08
Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Databpower of . with heuristic approaches so that we can have a polynomial time approximation algorithm based on a constructive method. . and . algorithms together provide execution plans that are very close to the best performing solutions, and achieve this in polynomial time. This makes our algorithm viable for large multi-way join queries.作者: 固執(zhí)點(diǎn)好 時間: 2025-3-29 19:54 作者: 先鋒派 時間: 2025-3-30 01:24
Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P Networksnsumption using our simulation model on PeerSim and compare push–pull method of ProFID with the well-known push-based gossiping approach. Based on the analysis results, we reformulate the upper bound for the peer’s energy cost.作者: 分離 時間: 2025-3-30 05:27
gineering and computer science, across the broad area of information technology. It provides access to the main innovative activities in research across the world, and points to the results obtained recently by some of the most active teams in both Europe and Asia..978-1-4471-5810-3978-1-4471-2155-8作者: Living-Will 時間: 2025-3-30 11:26
https://doi.org/10.1007/978-3-031-38226-0ts show that it is possible to obtain highly accurate classifications in terms of poet and time period. By using statistical analysis we are able to recommend which style marker and machine learning method are to be used in future studies.作者: 不舒服 時間: 2025-3-30 12:47
https://doi.org/10.1007/978-3-642-81028-2nsumption using our simulation model on PeerSim and compare push–pull method of ProFID with the well-known push-based gossiping approach. Based on the analysis results, we reformulate the upper bound for the peer’s energy cost.作者: 比喻好 時間: 2025-3-30 18:02
https://doi.org/10.1057/9780230512030search is far from satisfying all information needs, because many search queries are complex, require information integration, and go beyond what can be offered by a single Web page; on these queries, generalized search engines do not perform well enough. This paper addresses a new paradigm for sear作者: 輕信 時間: 2025-3-31 00:04 作者: 熱心 時間: 2025-3-31 03:11 作者: 性別 時間: 2025-3-31 08:43 作者: 使混合 時間: 2025-3-31 09:51
Summary, Conclusions and Recommendations,littable Data Dissemination Problem (RTU/DDP), which is a generalization of the unsplittable flow problem (UFP). RTU/DDP problem is NP-hard. Therefore, heuristic approaches are required to acquire . solutions to the problem. The problem is divided into two sub-problems: path selection and request pa作者: LEERY 時間: 2025-3-31 16:44 作者: Analogy 時間: 2025-3-31 19:48 作者: 逃避責(zé)任 時間: 2025-3-31 21:40
