標(biāo)題: Titlebook: Advances in Computing and Information - ICCI ‘91; International Confer Frank Dehne,Frantisek Fiala,Waldemar W. Koczkodaj Conference proceed [打印本頁(yè)] 作者: CULT 時(shí)間: 2025-3-21 20:08
書目名稱Advances in Computing and Information - ICCI ‘91影響因子(影響力)
書目名稱Advances in Computing and Information - ICCI ‘91影響因子(影響力)學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘91網(wǎng)絡(luò)公開度
書目名稱Advances in Computing and Information - ICCI ‘91網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘91被引頻次
書目名稱Advances in Computing and Information - ICCI ‘91被引頻次學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘91年度引用
書目名稱Advances in Computing and Information - ICCI ‘91年度引用學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘91讀者反饋
書目名稱Advances in Computing and Information - ICCI ‘91讀者反饋學(xué)科排名
作者: precede 時(shí)間: 2025-3-21 20:41 作者: FICE 時(shí)間: 2025-3-22 00:34
Computer Science and communications protocols: Research relationships, and commercial success. To achieve this, the chapter analyses various pioneering, mainly European cases of underwater wineries. Special attention is paid on Gaia Winery and its underwater cellar, which uses underwater wine making for producing “Assyrtiko”, the indigenous grape variety from Santorin作者: 指耕作 時(shí)間: 2025-3-22 04:44 作者: Desert 時(shí)間: 2025-3-22 11:05 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-22 13:49
Practical adaptive sorting,he global tourism. Recently, tourism destinations are in a tight race to launch new technologies that can efficiently and effectively advance services towards the satisfaction of touristic needs. The COVID-19 pandemic has made the adoption of technology essential rather than ancillary means of rende作者: 油膏 時(shí)間: 2025-3-22 17:23
Lower bounds for algebraic computation trees of functions with finite domains,n the tourism and hospitality industry. Over the last decade, technology has played a very significant role in the hospitality and tourism industry and a technological revolution has been seen. The effective application of innovative technologies enhances operational performance, improves service qu作者: 宏偉 時(shí)間: 2025-3-22 22:12 作者: 多骨 時(shí)間: 2025-3-23 03:14
The Interpolation-Based Bintree and its application to graphics,ion and its interplay with the global political decision-making forum of the United Nations Framework Convention on Climate Change (UNFCCC). By examining the successes and shortfalls of the IPCC process and comparing these with Technology Assessment (TA) theory and practice, we investigate whether s作者: 培養(yǎng) 時(shí)間: 2025-3-23 08:25 作者: 改進(jìn) 時(shí)間: 2025-3-23 12:22 作者: packet 時(shí)間: 2025-3-23 13:58 作者: Inflamed 時(shí)間: 2025-3-23 21:13 作者: 狗舍 時(shí)間: 2025-3-24 01:14
A tight lower bound for selection in sorted X+Y,hers entering the area of technology, and also the opportunity for practicing teachers to keep up to date with research informed ideas about teaching technology.Technology in the curriculum has continually faced a range of challenges throughout its history in many counties. Often the basis of the ch作者: Crumple 時(shí)間: 2025-3-24 04:39
Greedy triangulation approximates the optimum and can be implemented in linear time in the average been developed for undergraduate students of Industrial Design and Technology at Loughborough University of Technology..The rapid and continuing expansion of the range of devices and tools available to digital electronic systems designers, especially in the area of programmable and microprocessor sy作者: Vsd168 時(shí)間: 2025-3-24 07:15 作者: Digest 時(shí)間: 2025-3-24 11:35 作者: BIPED 時(shí)間: 2025-3-24 17:08 作者: onlooker 時(shí)間: 2025-3-24 22:30 作者: 纖細(xì) 時(shí)間: 2025-3-25 01:15
Storing shortest paths for a polyhedron,es various studies on the life cycles related to innovation management, the degree of technological change, and the concept of disruptive technology in the process of technological change. Section 1.6 discusses the Triple Helix model for competitive innovation systems and the role of clusters in facilitating innovation.作者: 駁船 時(shí)間: 2025-3-25 05:33
An improved join dependency for efficient constraint checking,not that of a high tariff, but an outright prohibition of imports of certain materials or equipment, as this will generally demand R&D to modify the received technology. The feasibility of doing so seems to depend strongly on the availability of the required technical skills.作者: 無法取消 時(shí)間: 2025-3-25 11:29
Reaping the benefits of mass production with massively parallel computing,egion’s recovery agenda. In conclusion, a business continuity model for Malaysian rural tourism enterpreneurs has been developed using structural equation modeling (SEM) approach, and a multiplier effect for rural economic development will be configured using the the Digitainability of SME’s rural tourism.作者: 使成核 時(shí)間: 2025-3-25 12:47 作者: Gustatory 時(shí)間: 2025-3-25 19:12
Computer Science and communications protocols: Research relationships,the positive impact of innovation into the food & wine tourism related businesses and providing suggestions for policy makers to use wine aqua tourism as a way for boosting regional tourism development.作者: Influx 時(shí)間: 2025-3-25 22:38
Practical adaptive sorting,of its use in Asian tourism industry. This conceptualization is significant to better understand the status and progression of Asian tourism industry with respect to the application of various technologies.作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-26 00:32 作者: 迅速飛過 時(shí)間: 2025-3-26 07:32
On the k-coloring of intervals,y, approaches can be selected and confederated to adhere to data minimization and anonymization as well as to leverage improvements in privacy-preserving computation and machine learning innovations. Regarding the use of OSINT, we support approaches that provide transparency to people regarding the use of the systems and the data they gather.作者: 知識(shí)分子 時(shí)間: 2025-3-26 08:50 作者: stroke 時(shí)間: 2025-3-26 13:08
Generating random graphs efficiently,e: to design “microworlds”, insulated and accessible islands of activity in which nuggets of relevant knowledge are encountered in a natural way—or at least, in which the chance of meeting the nuggets is designed to be as high as possible.作者: 使人入神 時(shí)間: 2025-3-26 20:03 作者: 外表讀作 時(shí)間: 2025-3-26 23:34 作者: convert 時(shí)間: 2025-3-27 02:13 作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-3-27 07:41 作者: Collar 時(shí)間: 2025-3-27 10:14 作者: 有權(quán)威 時(shí)間: 2025-3-27 16:16
,What’s wrong with formal programming methods?,try is being forced to transform the way it operates. With implications for those studying organizational behavior as well as strategic and tourism management, this study analyzes rapid change in this pivotal industry.978-3-030-61586-4978-3-030-61584-0作者: Excise 時(shí)間: 2025-3-27 21:01
A relationship between self-organizing lists and binary search trees,ot new. In contrast to Europe, a number of well-financed private equity funds in the United States exclusively target the technology sector for buyouts. What is new, however, is that many more technology companies, because of their lower valuation, could become targets of buyout investors in Europe,作者: GLIDE 時(shí)間: 2025-3-28 01:37
A tight lower bound for selection in sorted X+Y,nology.The book has been developed with an international audience in mind. While authors are naturally most familiar with their own country, efforts have been made to generalize from the principles of sound theory and research based practice to maximize applicability to local contexts.John Williams 作者: 人造 時(shí)間: 2025-3-28 03:19 作者: Itinerant 時(shí)間: 2025-3-28 07:50
Computer Supported Cooperative Worke exchange heuristic has an .(log .) asymptotic expected search time if the elements are accessed with independent and equal probabilities..We conjecture that: if we are given an “oblivious” list heuristic that converges and we transform it into a binary search tree heuristic that results in a commu作者: ADORE 時(shí)間: 2025-3-28 13:23 作者: Infraction 時(shí)間: 2025-3-28 15:53
User Interfaces for CSCW Systems,rence of the depths of the subtrees is bounded. We call these trees .. If this difference is a constant on the size of the depth d of the tree, then an O(log d) algorithm is presented. For any depth difference F(d), where F(d)?d, the approximation factor becomes O(F(d)log d).作者: 慟哭 時(shí)間: 2025-3-28 20:38 作者: LINES 時(shí)間: 2025-3-29 00:07 作者: 注意到 時(shí)間: 2025-3-29 05:49
https://doi.org/10.1007/978-1-4471-2009-4, we assume that each interval has a weight, and provide an O(knlogn) algorithm for k-coloring a set of intervals of maximum total weight. The best previous algorithm for this problem required time O(n.logn). These results provide improved solutions to problems of local register allocation, task scheduling, and the routing of nets on a chip.作者: fastness 時(shí)間: 2025-3-29 09:21
Computer Supported Cooperative Work algorithm that, using only the parity of the degree of each vertex, colors the vertices of a triangulated simple polygon using three colors. The second algorithm reconstructs the polygon and its triangulation from the degree sequence. We then show that our results extend to .-trees.作者: habitat 時(shí)間: 2025-3-29 13:53
Katie Phillps,Peter H. Hwang,Zara M. Patelof constraint equalities results in less elementary checking operations and hence an overall increase in efficiency in the normalization effort. The relationship among (.)-JDs of various degrees and orders is also studied and formalised.作者: 決定性 時(shí)間: 2025-3-29 16:13 作者: 新義 時(shí)間: 2025-3-29 20:22 作者: 嘲弄 時(shí)間: 2025-3-30 02:11
Computer Supported Cooperative Workresentation, we will explore some similarities and differences between these research areas by giving examples of problems which appear to be tractable in one area and not the other, and conclude with some ideas for building conceptual bridges.作者: certitude 時(shí)間: 2025-3-30 05:39
CSCW and Artificial Intelligenceg algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from .(.) to .(. log .) time for other common measures. Moreover, we extend the proof techniques to analyze an adaptive variant of .; previous claims were based only on simulation results.作者: GEAR 時(shí)間: 2025-3-30 09:37
CSCW For Real: Reflections on Experience,bitwise ‘a(chǎn)nd’ and 4) polynomial functions such as the gcd and modulo of two polynomials..We prove tight lower bounds for the above functions over a . in a RAM that uses arithmetic operations and that has unlimited power for answering YES/NO questions.作者: 大廳 時(shí)間: 2025-3-30 15:50 作者: interior 時(shí)間: 2025-3-30 18:46
Advances in Computing and Information - ICCI ‘91978-3-540-47359-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Esophagitis 時(shí)間: 2025-3-30 22:55 作者: Confess 時(shí)間: 2025-3-31 00:56
Computer Supported Cooperative WorkIn this paper, we propose an .(..) time algorithm that finds all-pairs quickest paths in a given network ., where . and . are the numbers of nodes and arcs, respectively, in .. Besides, the quickest path between any two nodes can be determined in .(log .) time, provided .(..) time preprocessing is made.作者: 不斷的變動(dòng) 時(shí)間: 2025-3-31 08:40 作者: 修飾語(yǔ) 時(shí)間: 2025-3-31 12:12 作者: Acumen 時(shí)間: 2025-3-31 15:15 作者: 解決 時(shí)間: 2025-3-31 20:07 作者: temperate 時(shí)間: 2025-3-31 22:09
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/147323.jpg作者: 使糾纏 時(shí)間: 2025-4-1 04:22
Computer Supported Cooperative Workted areas of research denoted Communications Software Engineering and Protocols, most corresponding problems are on their way to a solution. In this presentation, we will explore some similarities and differences between these research areas by giving examples of problems which appear to be tractabl作者: 和平主義者 時(shí)間: 2025-4-1 07:53
CSCW and Artificial Intelligenceerties of measures of presortedness rather than on the combinatorial properties of sorting algorithms. Using it, we obtain a practical adaptive sorting algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from .(.) to .(. log .) time for other common meas作者: Latency 時(shí)間: 2025-4-1 12:01 作者: cumulative 時(shí)間: 2025-4-1 17:23
User Interfaces for CSCW Systems,nd has been studied for both graphs and matrices. The problem has important applications in large distributed processing systems and databases as well as communication theory. The technique presented here is used to provide a communication protocol for maximum throughput and concurrency control. We 作者: 思想 時(shí)間: 2025-4-1 19:08 作者: monologue 時(shí)間: 2025-4-1 23:41
https://doi.org/10.1007/978-1-4471-2009-4me color if and only if those intervals do not overlap. Two versions of the problem are considered. For the first, we provide an O(k+n) time algorithm for k-coloring a maximum cardinality subset of the intervals. The best previous algorithm for this problem required time O(kn). In the second version作者: SYN 時(shí)間: 2025-4-2 05:06
Computer Supported Cooperative Workmple proof of Chvàtal‘s art gallery theorem and improve or simplify a number of algorithms that deal with triangulated simple polygons. We describe two improved algorithms, both based on the degree sequence of the boundary vertices of the given triangulated simple polygon. The first is a linear-time作者: 摻和 時(shí)間: 2025-4-2 11:01
Computer Supported Cooperative Work . and we access an element . using the move-to-front heuristic to obtain a list .. If we insert . into an empty binary search tree to obtain . and insert . into an empty binary search tree to obtain ., then we can obtain . from . by accessing . using the move-to-root heuristic. We thus have a commu作者: BROW 時(shí)間: 2025-4-2 12:21 作者: 盡責(zé) 時(shí)間: 2025-4-2 15:36 作者: 枯萎將要 時(shí)間: 2025-4-2 20:40
