標(biāo)題: Titlebook: SOFSEM 2021: Theory and Practice of Computer Science; 47th International C Tomá? Bure?,Riccardo Dondi,Prudence W.H. Wong Conference proceed [打印本頁(yè)] 作者: 可怖 時(shí)間: 2025-3-21 18:26
書目名稱SOFSEM 2021: Theory and Practice of Computer Science影響因子(影響力)
書目名稱SOFSEM 2021: Theory and Practice of Computer Science影響因子(影響力)學(xué)科排名
書目名稱SOFSEM 2021: Theory and Practice of Computer Science網(wǎng)絡(luò)公開度
書目名稱SOFSEM 2021: Theory and Practice of Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱SOFSEM 2021: Theory and Practice of Computer Science被引頻次
書目名稱SOFSEM 2021: Theory and Practice of Computer Science被引頻次學(xué)科排名
書目名稱SOFSEM 2021: Theory and Practice of Computer Science年度引用
書目名稱SOFSEM 2021: Theory and Practice of Computer Science年度引用學(xué)科排名
書目名稱SOFSEM 2021: Theory and Practice of Computer Science讀者反饋
書目名稱SOFSEM 2021: Theory and Practice of Computer Science讀者反饋學(xué)科排名
作者: conspicuous 時(shí)間: 2025-3-21 22:39
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/860230.jpg作者: boisterous 時(shí)間: 2025-3-22 03:21
https://doi.org/10.1007/978-3-030-67731-2artificial intelligence; communication systems; computer networks; computer programming; computer system作者: 指耕作 時(shí)間: 2025-3-22 07:53 作者: 強(qiáng)制性 時(shí)間: 2025-3-22 08:46
SOFSEM 2021: Theory and Practice of Computer Science978-3-030-67731-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 食物 時(shí)間: 2025-3-22 15:54
Algorithms that Access the Input via Queriesgs. We discuss different aspects of models where an algorithm needs to query the input, and of how the performance of algorithms for such models can be measured. After that, we give some concrete examples of algorithmic settings and results for scenarios where algorithms access the input via queries作者: 不整齊 時(shí)間: 2025-3-22 18:07
Towards Knowledge Exchange: State-of-the-Art and Open Problemsping rules and performing knowledge exchange between two Knowledge Bases (KBs). We highlight the challenges addressed in Kensho, including managing the rich structural complexity of KBs and the need to handle incomplete correspondences between property paths. We use Kensho to highlight many open pro作者: nautical 時(shí)間: 2025-3-22 23:32
Invited Talk: Resilient Distributed Algorithmsures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as, the Bitcoin network and cloud computing, introduce in addition, new security challenges that deserve urgent attenti作者: sundowning 時(shí)間: 2025-3-23 01:51 作者: 鳴叫 時(shí)間: 2025-3-23 06:16
Amnesiac Flooding: Synchronous Stateless Information Disseminationpplications, increasing performance by removing the load caused by retention of session information. In this paper we analyze the termination time of multi-source amnesiac flooding. We provide tight upper and lower bounds for the time complexity.作者: 許可 時(shí)間: 2025-3-23 13:12 作者: 親屬 時(shí)間: 2025-3-23 15:29 作者: exclusice 時(shí)間: 2025-3-23 18:46 作者: chastise 時(shí)間: 2025-3-24 01:54 作者: BOON 時(shí)間: 2025-3-24 03:45 作者: 低能兒 時(shí)間: 2025-3-24 08:09
Concatenation Operations and Restricted Variants of Two-Dimensional Automatations, restricted two-dimensional automata are only permitted to move their input heads in three or two directions; these models are called three-way and two-way two-dimensional automata, respectively..In two dimensions, we may extend the notion of concatenation in multiple ways, depending on the wo作者: 啪心兒跳動(dòng) 時(shí)間: 2025-3-24 12:39 作者: 食道 時(shí)間: 2025-3-24 17:50 作者: Guaff豪情痛飲 時(shí)間: 2025-3-24 21:50
Hierarchical b-Matchingmatching every vertex . has an associated bound ., and a maximum .-matching is a maximum set of edges, such that every vertex . appears in at most . of them. We study an extension of this problem, termed .. In this extension, the vertices are arranged in a hierarchical manner. At the first level the作者: assent 時(shí)間: 2025-3-25 02:01
Improved Algorithms for Online Load Balancingtask allocation) over . servers, and then the environment reveals the load of each server, which determines the computation time of each server for processing the task assigned. After all rounds, the cost of the player is measured by some norm of the cumulative computation-time vector. The cost is t作者: osculate 時(shí)間: 2025-3-25 06:30 作者: Interlocking 時(shí)間: 2025-3-25 11:11
New Bounds on the Half-Duplex Communication Complexityical model of communication complexity introduced by Yao, in the half-duplex model, Alice and Bob can speak or listen simultaneously, as if they were talking using a walkie-talki.e. The motivation for such a communication model comes from the study of the KRW conjecture. Following the open questions作者: 輕而薄 時(shí)間: 2025-3-25 14:08
Towards Minimally Conscious Cyber-Physical Systems: A Manifestos to more trustworthy systems, as it strengthens their behavioral flexibility in varying environments and their resilience to operation and cooperation failures of their components and as a whole. The notion of minimal machine consciousness has the potential to become one of the defining attributes of Industry 4.0.作者: Comedienne 時(shí)間: 2025-3-25 18:41
Balanced Independent and Dominating Sets on Colored Interval Graphsnd the other by the vertex cover number of .. Moreover, for an optimization variant of BIS on interval graphs, we present a polynomial time approximation scheme (PTAS) and an . time 2-approximation algorithm.作者: Costume 時(shí)間: 2025-3-25 20:56 作者: Coma704 時(shí)間: 2025-3-26 00:45 作者: Aggressive 時(shí)間: 2025-3-26 05:11
0302-9743 Trends in Theory and Practice of Computer Science, which was held online during January 25–28, 2021, hosted by the Free University of Bozen-Bolzano, Italy..The 33 full and 7 short papers included in the volume were carefully reviewed and selected from 100 submissions. They were organized in topical作者: FOLLY 時(shí)間: 2025-3-26 10:58 作者: SEMI 時(shí)間: 2025-3-26 13:15 作者: ungainly 時(shí)間: 2025-3-26 19:54
New Bounds on the Half-Duplex Communication Complexityomplexity of the Karchmer-Wigderson games for the counting functions and for the recursive majority function, adapting the ideas used in the classical communication complexity. Finally, we define the non-deterministic half-duplex complexity and establish bounds connecting it with non-deterministic complexity in the classical model.作者: Limited 時(shí)間: 2025-3-26 21:42
Asymptotic Approximation by Regular Languagese (including languages with transcendental generating function and transcendental density, in particular), while a certain simple deterministic context-free language and the set of primitive words are .-immeasurable in a strong sense.作者: 逗留 時(shí)間: 2025-3-27 02:48 作者: Loathe 時(shí)間: 2025-3-27 08:30
0302-9743 sections on: foundations of computer science; foundations of software engineering; foundations of data science and engineering; and foundations of algorithmic computational biology. The book also contains 5 invited papers..978-3-030-67730-5978-3-030-67731-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Foreknowledge 時(shí)間: 2025-3-27 12:57
Algorithms that Access the Input via Queriese measured. After that, we give some concrete examples of algorithmic settings and results for scenarios where algorithms access the input via queries. Finally, we discuss recent results for the setting of computing with explorable uncertainty with parallel queries and with untrusted predictions.作者: 使聲音降低 時(shí)間: 2025-3-27 15:49 作者: Accommodation 時(shí)間: 2025-3-27 19:17 作者: rectum 時(shí)間: 2025-3-27 22:09
ncompass the great immortal figures in human literature—Don Quixote, Faust, Sherlock Holmes and so on—as well as the protagonists of single novels such as Anna Karenina, Emma Woodhouse and Emma Bovary and even the unknown characters in the oral tradition of storytelling developed by small communitie作者: Lucubrate 時(shí)間: 2025-3-28 04:11 作者: 清楚 時(shí)間: 2025-3-28 09:24
Bahar Ghadiri Bashardoost,Kelly Lyons,Renée J. MillerA syncretistic theoryThis book is devoted to fictional entities or, to be more precise, fictional entities as they emerge from the literary process of storytelling. They encompass the great immortal figures in human literature—Don Quixote, Faust, Sherlock Holmes and so on—as well as the protagonists作者: 微粒 時(shí)間: 2025-3-28 13:36
Merav ParterA syncretistic theoryThis book is devoted to fictional entities or, to be more precise, fictional entities as they emerge from the literary process of storytelling. They encompass the great immortal figures in human literature—Don Quixote, Faust, Sherlock Holmes and so on—as well as the protagonists作者: thrombus 時(shí)間: 2025-3-28 14:49 作者: 責(zé)任 時(shí)間: 2025-3-28 22:14
ncompass the great immortal figures in human literature—Don Quixote, Faust, Sherlock Holmes and so on—as well as the protagonists of single novels such as Anna Karenina, Emma Woodhouse and Emma Bovary and even the unknown characters in the oral tradition of storytelling developed by small communitie作者: 很是迷惑 時(shí)間: 2025-3-29 00:31
Volker TurauA syncretistic theoryThis book is devoted to fictional entities or, to be more precise, fictional entities as they emerge from the literary process of storytelling. They encompass the great immortal figures in human literature—Don Quixote, Faust, Sherlock Holmes and so on—as well as the protagonists作者: Graduated 時(shí)間: 2025-3-29 06:34
Khaled Jawhar,Evangelos Kranakisatforms in order to develop software products which are freely available to anyone to use, modify and distribute (Mustonen, 2003). This altruistic behavior seems contra-intuitive from a purely economical point of view. However, intrinsic factors of motivation have been identified as pervasive factor作者: Mortar 時(shí)間: 2025-3-29 08:11 作者: 我沒(méi)有命令 時(shí)間: 2025-3-29 14:55
Florian Bridoux,Caroline Gaze-Maillot,Kévin Perrot,Sylvain Senédetermines that those uncomplexed and cationic polymer chains free in the solution mixture of polymer and DNA facilitate and promote gene transfection. Furthermore, by using a combination of synthetic chemistry, polymer physics and molecular biology, Yue confirms that it is those cationic polymer ch作者: Mendicant 時(shí)間: 2025-3-29 17:30
Taylor J. Smith,Kai Salomaamulti-criteria decision making challenges raised in machine This book introduces some?contemporary?approaches?on the application of?fuzzy and hesitant fuzzy sets in machine learning tasks such as?classification, clustering and dimension?reduction.?Many?situations?arise?in machine learning algorithms作者: 老巫婆 時(shí)間: 2025-3-29 20:01
Michele Flammini,Bojana Kodric,Martin Olsen,Giovanna Varricchiomulti-criteria decision making challenges raised in machine This book introduces some?contemporary?approaches?on the application of?fuzzy and hesitant fuzzy sets in machine learning tasks such as?classification, clustering and dimension?reduction.?Many?situations?arise?in machine learning algorithms作者: flimsy 時(shí)間: 2025-3-30 02:17 作者: 溝通 時(shí)間: 2025-3-30 05:39
Yuval Emek,Shay Kutten,Mordechai Shalom,Shmuel Zaksmulti-criteria decision making challenges raised in machine This book introduces some?contemporary?approaches?on the application of?fuzzy and hesitant fuzzy sets in machine learning tasks such as?classification, clustering and dimension?reduction.?Many?situations?arise?in machine learning algorithms作者: choroid 時(shí)間: 2025-3-30 10:42 作者: 畸形 時(shí)間: 2025-3-30 16:10 作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-30 16:59
Barun Gorain,Kaushik Mondal,Supantha Pandithip degrees. The book is expected to bring closer?the? communities of pure mathematicians of fuzzy?sets and data scientists.?.978-3-030-94068-3978-3-030-94066-9Series ISSN 1434-9922 Series E-ISSN 1860-0808 作者: packet 時(shí)間: 2025-3-30 23:08 作者: misanthrope 時(shí)間: 2025-3-31 01:29 作者: 彎曲道理 時(shí)間: 2025-3-31 08:03 作者: 貴族 時(shí)間: 2025-3-31 09:37 作者: musicologist 時(shí)間: 2025-3-31 16:07 作者: 不適當(dāng) 時(shí)間: 2025-3-31 20:02
Sujoy Bhore,Jan-Henrik Haunert,Fabian Klute,Guangping Li,Martin N?llenburg作者: 碌碌之人 時(shí)間: 2025-3-31 22:06 作者: OTHER 時(shí)間: 2025-4-1 02:33
Yuriy Dementiev,Artur Ignatiev,Vyacheslav Sidelnik,Alexander Smal,Mikhail Ushakov
