標(biāo)題: Titlebook: Advances in Computing and Information - ICCI ‘90; International Confer S. G. Akl,F. Fiala,W. W. Koczkodaj Conference proceedings 1990 Sprin [打印本頁] 作者: 撕成碎片 時間: 2025-3-21 18:44
書目名稱Advances in Computing and Information - ICCI ‘90影響因子(影響力)
書目名稱Advances in Computing and Information - ICCI ‘90影響因子(影響力)學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘90網(wǎng)絡(luò)公開度
書目名稱Advances in Computing and Information - ICCI ‘90網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘90被引頻次
書目名稱Advances in Computing and Information - ICCI ‘90被引頻次學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘90年度引用
書目名稱Advances in Computing and Information - ICCI ‘90年度引用學(xué)科排名
書目名稱Advances in Computing and Information - ICCI ‘90讀者反饋
書目名稱Advances in Computing and Information - ICCI ‘90讀者反饋學(xué)科排名
作者: 葡萄糖 時間: 2025-3-21 21:18 作者: 緩解 時間: 2025-3-22 01:53 作者: PARA 時間: 2025-3-22 06:41
0302-9743 alls, Ontario, Canada, May 23-26, 1990. ICCI conferences provide an international forum for presenting new results in research, development and applications in computing and information. Their primary goal is to promote an interchange of ideas and cooperation between practitioners and theorists in t作者: 貧困 時間: 2025-3-22 11:11
Customer-Relationship-Management,. In particular, we analyze the worst-case, the best-case and the average-case complexity related to the formal languages of approximation machines. The relationship between density of a complexity class and the “goodness” of an approximation is also investigated.作者: PLIC 時間: 2025-3-22 12:59
VI Schlussbetrachtung und Ausblick,t-everywhere complex sets — that is equivalent to the traditional infinitely-often complex hierarchy result. The almost-everywhere complex sets constructed here are the first such sets constructed for nondeterministic complexity classes.作者: 合唱團 時間: 2025-3-22 19:11
https://doi.org/10.1007/978-3-663-05775-8 show that (1) constant-reversal 1-tape ATM‘s accept only regular languages and (2) there exists a recursive function h(k,r,n) such that for every k-state off-line 1-tape ATM M running in r reversals, the language accepted by M is in ASPACE(h(k,r,n)).作者: N防腐劑 時間: 2025-3-22 22:14
CRM-Systeme und Basistechnologiene subclasses of the general problem. The contribution of this paper is a new algorithm that finds elements with two-tree-factors in time O(..). The number of elements that can be found in polynomial time is significantly increased by our algorithm as compared with the algorithms known so far.作者: Foam-Cells 時間: 2025-3-23 04:38
CRM mit Mitarbeitern erfolgreich umsetzen two sets . and . of . elements that differ in only . elements, we can perform any set operation such as . ? . in only .(. log .) expected time (without knowing in advance anything about the differences between . and .).作者: etiquette 時間: 2025-3-23 07:49
https://doi.org/10.1007/978-3-663-05775-8 data structure can be designed which allowed updates in constant time and supports fingers. We answer the question in the affirmative by giving an algorithm in the RAM with logarithmic word size model [1].作者: 詳細(xì)目錄 時間: 2025-3-23 13:39 作者: 拘留 時間: 2025-3-23 14:02
Conference proceedings 1990rio, Canada, May 23-26, 1990. ICCI conferences provide an international forum for presenting new results in research, development and applications in computing and information. Their primary goal is to promote an interchange of ideas and cooperation between practitioners and theorists in the interdi作者: 事與愿違 時間: 2025-3-23 20:23 作者: Kidnap 時間: 2025-3-23 23:30 作者: 恩惠 時間: 2025-3-24 02:40
Classification by minimum-message-length inference,978-3-8349-9919-1作者: 夾死提手勢 時間: 2025-3-24 08:06 作者: Digitalis 時間: 2025-3-24 13:13 作者: Inclement 時間: 2025-3-24 17:54
Using the hamiltonian path operator to capture NP,978-3-8349-6836-4作者: Intellectual 時間: 2025-3-24 22:27
0302-9743 networking, computer architecture and VLSI, - Data and software engineering, databases, expert systems, information systems, decision making, and AI methodologies.978-3-540-53504-1978-3-540-46677-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Glaci冰 時間: 2025-3-24 23:50
CRM mit Mitarbeitern erfolgreich umsetzenre found in nearby low-resolution pixels and previously-coded high-resolution pixels. We show that this problem is NP-Hard by analogy to the well-known Satisfiability problem, then propose a recursive algorithm for solving it in optimal time as a depth-first tree search. The effectiveness of predict作者: Ophthalmoscope 時間: 2025-3-25 05:19 作者: allergen 時間: 2025-3-25 09:49 作者: CHOP 時間: 2025-3-25 14:13 作者: 單調(diào)女 時間: 2025-3-25 16:24 作者: 忘川河 時間: 2025-3-25 22:31
,On the complexity of (off-line) 1-tape ATM’s running in constant reversals,nd man versucht, dem Problem durch die Einrichtung von Institutionen speziell zu diesem Zweck gerecht zu werden. Der Autor widmet sich in seiner Arbeit den sowohl in Frankreich als auch in Deutschland in den letzten zwei Jahrzehnten mehr und mehr eingerichteten Technologietransfereinrichtungen und n作者: Exonerate 時間: 2025-3-26 03:17
A constant update time finger search tree,nen Diversifikation in verwandte Gesch?ftsbereiche hatte insbesondere die unverbundene, konglomerate Diversifikation in den 60er und 70er Jahren stark zugenommen. Dieser Trend kam jedoch sp?testens Mitte der 80er Jahre zum Stillstand. Seitdem ist ein deutlicher Rückgang bei der Zahl der unverbunden diversifizierten Unternehmen zu beobachten..作者: 顛簸地移動 時間: 2025-3-26 07:05
Computing the transitive closure of symmetric matrices,ensure that technology was used, which is true in many industrial and organizational contexts. However, with the increasing demands for educational applications of information technology and changing working practices, there is s need to re-examine user acceptance issues as they emerge within and ou作者: audiologist 時間: 2025-3-26 08:56
Almost-everywhere complexity, bi-immunity and nondeterministic space,tte Bront? throws open the doors of the attic and yet only lets us glimpse at what it has been hiding. As Aleida Assmann explains, the attic is a metaphorical figure for ‘latent memory’ — a sort of repository which is there and can, by will or violence, be brought to reveal what it stores (1999).作者: FAWN 時間: 2025-3-26 13:02
Fast left-linear semi-unification,nesan (1994) entnommen und an den vorliegenden Untersuchungskontext angepasst. Tabelle 5-1 zeigt die Kurzbezeichnungen und Formulierungen der Items. Die Indikatoren wurden vom Respondenten II des Technologienehmers in Bezug auf das Steinbeiszentrum beurteilt (1 = trifft überhaupt nicht zu;... 7 = trifft voll und ganz zu).作者: Exposure 時間: 2025-3-26 19:00 作者: 婚姻生活 時間: 2025-3-26 22:37
An axiomatization of wait-freedom and low-atomicity,chhochschulen sowie in einem dritten Schritt die Ann?herung von hochschulischer und dualer Bildung, das hei?t von Wissen und bislang — in den deutschsprachigen L?ndern — noch mittelalterlichzünftisch organisierte Berufsbildung im Handwerk zu beobachten.作者: 貪婪的人 時間: 2025-3-27 03:18 作者: condone 時間: 2025-3-27 06:33 作者: ORBIT 時間: 2025-3-27 12:30
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/147322.jpg作者: 在前面 時間: 2025-3-27 15:06 作者: garrulous 時間: 2025-3-27 20:06 作者: KEGEL 時間: 2025-3-27 23:42
https://doi.org/10.1007/3-540-53504-7algorithm; algorithms; coding theory; communication; information; information theory; programming; algorith作者: GROG 時間: 2025-3-28 04:12
978-3-540-53504-1Springer-Verlag Berlin Heidelberg 1990作者: certain 時間: 2025-3-28 08:25
https://doi.org/10.1007/978-3-322-86955-5bility of histories, ., of paths through the internal state space of the implementation, the . → ∞ asymptotics of the space and time costs of a sequence of . supported operations are computed..For list implementations the mean integrated spatial cost is asymptotically proportional to .., and its sta作者: Explicate 時間: 2025-3-28 10:59
Customer-Relationship-Management,f computation. We strengthen previous results by showing the interpretation of the complexity classes with density in terms of approximation languages. In particular, we analyze the worst-case, the best-case and the average-case complexity related to the formal languages of approximation machines. T作者: Brochure 時間: 2025-3-28 16:55 作者: 使成整體 時間: 2025-3-28 21:19 作者: Parley 時間: 2025-3-29 02:28
CRM mit Mitarbeitern erfolgreich umsetzen resolution several times by factors of two. Next, the resultant layers are losslessly encoded. The lowest-resolution layer is encoded first, then each higher resolution image is built incrementally upon the previous, until the original image is finally encoded. Coding efficiency may be improved if 作者: manifestation 時間: 2025-3-29 04:08 作者: 迎合 時間: 2025-3-29 09:08
Rainer Schnauffer,Hans-Hermann Jung. The same problem is inherent in any MML inference which infers many discrete "nuisance" parameters. A solution has been found using a novel coding trick, which could be useful in many inductive inferences.作者: CLASP 時間: 2025-3-29 14:52 作者: justify 時間: 2025-3-29 17:51
https://doi.org/10.1007/978-3-663-05775-8g Turing machine (ATM) whose (work)tape head makes only a constant number of reversals. In this paper, we answer the open question in the negative. We show that (1) constant-reversal 1-tape ATM‘s accept only regular languages and (2) there exists a recursive function h(k,r,n) such that for every k-s作者: 壓倒性勝利 時間: 2025-3-29 23:26 作者: 原來 時間: 2025-3-30 02:47 作者: 呼吸 時間: 2025-3-30 06:43
CRM-Systeme und Basistechnologienlational database queries. Although the problem has been shown to be .-complete in general, many polynomial-time algorithms have been proposed for some subclasses of the general problem. The contribution of this paper is a new algorithm that finds elements with two-tree-factors in time O(..). The nu作者: SNEER 時間: 2025-3-30 08:59 作者: 闡明 時間: 2025-3-30 13:49 作者: Felicitous 時間: 2025-3-30 19:28
Advances in Computing and Information - ICCI ‘90978-3-540-46677-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鍍金 時間: 2025-3-30 22:31 作者: 救護車 時間: 2025-3-31 01:00
Matthias Meyer,Stefan Weing?rtnerearch trees and digital trees. In particular we give the exact solution for a fringe analysis problem, a technique used for search trees, that was unknown before. This method also makes easier to solve some scalar recurrences.作者: 狂亂 時間: 2025-3-31 08:14 作者: META 時間: 2025-3-31 10:12
Front Matter of stakeholders and communities in the revivification of non-functioning public spaces, a hideous legacy of the communist era compounded by the transition period and today’s neoliberal practices. This platform was launched on a web site in 2009 as a community-driven initiative to challenge uniform 作者: 饒舌的人 時間: 2025-3-31 13:49 作者: 痛苦一生 時間: 2025-3-31 17:38 作者: 堅毅 時間: 2025-4-1 00:30 作者: Corporeal 時間: 2025-4-1 02:59 作者: 開玩笑 時間: 2025-4-1 06:11 作者: 木質(zhì) 時間: 2025-4-1 11:30
