標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2008; 33rd International S Edward Ochmański,Jerzy Tyszkiewicz Conference proceedings 2008 Spri [打印本頁] 作者: 法令 時(shí)間: 2025-3-21 16:34
書目名稱Mathematical Foundations of Computer Science 2008影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2008影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2008網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2008網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2008被引頻次
書目名稱Mathematical Foundations of Computer Science 2008被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2008年度引用
書目名稱Mathematical Foundations of Computer Science 2008年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2008讀者反饋
書目名稱Mathematical Foundations of Computer Science 2008讀者反饋學(xué)科排名
作者: atrophy 時(shí)間: 2025-3-21 23:14 作者: 虛假 時(shí)間: 2025-3-22 02:14 作者: 慢跑鞋 時(shí)間: 2025-3-22 07:10 作者: Mercantile 時(shí)間: 2025-3-22 09:14
Conference proceedings 2008 Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, a作者: 使人入神 時(shí)間: 2025-3-22 15:07
0302-9743 , cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.978-3-540-85237-7978-3-540-85238-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: integral 時(shí)間: 2025-3-22 20:02
Question/Answer Games on Towers and Pyramids pyramids, respectively. We completely solve the problem of determining the winner for Q/A games on towers. We also solve an open problem on Q/A games on pyramids from [1,2]. Furthermore, we give some non-trivial lower and upper bounds for the rest of the cases for Q/A games on pyramids.作者: 我要沮喪 時(shí)間: 2025-3-23 00:51 作者: 拱形面包 時(shí)間: 2025-3-23 04:15
A Robust Class of Regular Languageslgebraic characterization in terms of finite ordered monoids, which implies that . is decidable: given a regular language, one can effectively decide whether or not it belongs to .. We propose as a challenge to find a constructive description and a logical characterization of ..作者: arterioles 時(shí)間: 2025-3-23 08:55
Optimizing Conjunctive Queries over Trees Using Schema Informationies that can test for equalities and inequalities of data values. Here, satisfiability and validity are decidable, but containment is undecidable, even without schema information. On the other hand, containment w.r.t. a schema becomes decidable again if the “l(fā)arger” query is not allowed to use both equalities and inequalities.作者: Exonerate 時(shí)間: 2025-3-23 10:08 作者: 正常 時(shí)間: 2025-3-23 15:05 作者: 挫敗 時(shí)間: 2025-3-23 21:40 作者: 舊石器時(shí)代 時(shí)間: 2025-3-23 22:40 作者: condemn 時(shí)間: 2025-3-24 05:45
Conference proceedings 2008lgorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.作者: Lyme-disease 時(shí)間: 2025-3-24 07:27 作者: 上下倒置 時(shí)間: 2025-3-24 11:15 作者: Individual 時(shí)間: 2025-3-24 15:37 作者: Preserve 時(shí)間: 2025-3-24 20:16 作者: START 時(shí)間: 2025-3-25 00:05
https://doi.org/10.1007/978-3-540-85238-4Automat; algorithms; artificial intelligence; automata; complexity; computer science; data structure; data 作者: 高度贊揚(yáng) 時(shí)間: 2025-3-25 06:22
One Useful Logic That Defines Its Own Truths also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof.作者: 山頂可休息 時(shí)間: 2025-3-25 09:31 作者: 小平面 時(shí)間: 2025-3-25 13:04 作者: installment 時(shí)間: 2025-3-25 19:04 作者: Intruder 時(shí)間: 2025-3-25 20:32 作者: periodontitis 時(shí)間: 2025-3-26 01:15
Antonio Cano Gómez,Jean-éric Pinr-surround cells of the retina and lateral geniculate nucleus (LGN), to the orientation and directionally selective simple and complex cells of the mammalian striate cortex. Yet the underlying neuronal circuitry responsible for the construction of new receptive field properties at each stage is poor作者: tinnitus 時(shí)間: 2025-3-26 06:45
Rastislav Královi?,Richard Královi?ntia. The neuropathology of HD is a marked neuronal death in the striatum while other brain structures are selectively spared. The defective gene in HD contains a trinucleotide CAG repeat expansion within its coding region that is expressed as a polyglutamine repeat in the protein huntingtin. CAG ex作者: lymphedema 時(shí)間: 2025-3-26 08:37 作者: 膽小懦夫 時(shí)間: 2025-3-26 15:17 作者: Abbreviate 時(shí)間: 2025-3-26 18:12
Vladimir E. Alekseev,Vadim Lozin,Dmitriy Malyshev,Martin Milani?o the embryonic neurons and their precursor cells. To fathom the mechanisms underlying these interactive processes, a detailed knowledge of the course of neurogenesis at the cellular level is essential. Once such knowledge is available, specific and well-focused questions can be formulated at the bi作者: 充氣球 時(shí)間: 2025-3-26 21:16 作者: 詳細(xì)目錄 時(shí)間: 2025-3-27 01:29 作者: multiply 時(shí)間: 2025-3-27 09:19
Henrik Bj?rklund,Wim Martens,Thomas Schwenticked axons, and plastic changes in axonal arborization are also controlled by a complex array of environmental cues. An important category of regulatory influences involves target-derived hormone-like peptides act- ing on neuronal cell surface receptors. Nerve growth factor (NGF) was the first such fa作者: Fibroid 時(shí)間: 2025-3-27 12:52
Hans L. Bodlaender,Michael R. Fellows,Pinar Heggernes,Federico Mancini,Charis Papadopoulos,Frances Rand plastic changes in axonal arborization are also controlled by a complex array of environmental cues. An important category of regulatory influences involves target-derived hormone-like peptides act- ing on neuronal cell surface receptors. Nerve growth factor (NGF) was the first such factor to be作者: Mawkish 時(shí)間: 2025-3-27 16:28 作者: CHAR 時(shí)間: 2025-3-27 20:57 作者: 詞匯記憶方法 時(shí)間: 2025-3-27 22:57
Mathieu Brévilliers,Nicolas Chevallier,Dominique Schmittet the challenges associated with the daily changes in the external environment. The circadian pacemaker responsible for the temporal internal organisation and the generation of endogenous rhythms of approximately 24 h is located in the hypothalamic suprachiasmatic nucleus (SCN) in mammals. The endo作者: 威脅你 時(shí)間: 2025-3-28 02:58 作者: 頭盔 時(shí)間: 2025-3-28 08:36
Ioannis Caragiannis,Gianpiero Monacoet the challenges associated with the daily changes in the external environment. The circadian pacemaker responsible for the temporal internal organisation and the generation of endogenous rhythms of approximately 24 h is located in the hypothalamic suprachiasmatic nucleus (SCN) in mammals. The endo作者: 沐浴 時(shí)間: 2025-3-28 13:35 作者: aplomb 時(shí)間: 2025-3-28 15:46
Venkatesan T. Chakaravarthy,Sambuddha Roy changes in the external environment. The circadian pacemaker responsible for the temporal internal organisation and the generation of endogenous rhythms of approximately 24 h is located in the hypothalamic suprachiasmatic nucleus (SCN) in mammals. The endogenous period generated by the pacemaker is作者: 蛤肉 時(shí)間: 2025-3-28 20:15
Emilie Charlier,Michel Rigoans of the inner ear is non-controversial. Opposing concepts that the centrally originating efferent fibers of the cochlear and vestibular nerves are parasympathetic (Ross 1969; Eyries and Chouard, 1970), and that the efferent-type terminals on hair cells might be collateral branches of spiral and v作者: miscreant 時(shí)間: 2025-3-28 23:43
One Useful Logic That Defines Its Own Truths also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof.作者: ATOPY 時(shí)間: 2025-3-29 05:00
On Synchronous and Asynchronous Interaction in Distributed Systemsgms of synchronous and asynchronous interaction in the context of distributed systems. We investigate to what extent or under which conditions synchronous interaction is a valid concept for specification and implementation of such systems. We choose Petri nets as our system model and consider differ作者: Formidable 時(shí)間: 2025-3-29 08:34 作者: 夜晚 時(shí)間: 2025-3-29 14:44
Algebraic Graph Algorithmsrank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch. The static complexity of these problem equals the matrix multiplication complexity, whereas the presented solutions work in subqua作者: hemophilia 時(shí)間: 2025-3-29 18:33
Question/Answer Games on Towers and Pyramidsns and are a generalization of Rényi-Ulam Game. A .-round Q/A game, .?=?(.,(.., ..., ..)), is played on a rooted directed acyclic graph, .?=?(.,.). In the .-th round, Paul selects a set, ..???., of at most .. non-terminal vertices. Carole responds by choosing an outgoing edge from each vertex in ...作者: nitric-oxide 時(shí)間: 2025-3-29 23:01 作者: Euphonious 時(shí)間: 2025-3-30 01:53
When Ignorance Helps: Graphical Multicast Cost Sharing Games too optimistic or even unfeasible. In such situations, the set of players of which each player knows the chosen strategy can be modeled by means of a social knowledge graph in which nodes represent players and there is an edge from . to . if . knows .. Following the framework introduced in [3], we 作者: 滑稽 時(shí)間: 2025-3-30 07:18 作者: 壯麗的去 時(shí)間: 2025-3-30 08:50
Optimizing Conjunctive Queries over Trees Using Schema Informationquery containment and validity are 2EXPTIME-complete w.r.t. a schema (DTD or Relax NG). Furthermore, we show that satisfiability for conjunctive queries w.r.t. a schema can be decided in NP. The problem is NP-hard already for queries using only one kind of axis. Finally, we consider conjunctive quer作者: 漂泊 時(shí)間: 2025-3-30 14:36
Clustering with Partial Information, such that the editing cost is minimized. The . problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number of cliques is minimized. Both problems are known to be NP-hard, and they have been previously studied with respect to approximation and fixed parame作者: Gullible 時(shí)間: 2025-3-30 17:10 作者: Processes 時(shí)間: 2025-3-30 23:00
On the Shortest Linear Straight-Line Program for Computing Linear Formsof linear forms. SLP is shown to be NP-hard. Furthermore, a special case of the corresponding decision problem is shown to be . SNP-Complete..Algorithms producing cancellation-free straight-line programs, those in which there is never any cancellation of variables in GF(2), have been proposed for ci作者: 聲音刺耳 時(shí)間: 2025-3-31 03:59
Flip Algorithm for Segment Triangulationstes, edges, and faces. The set of faces is a maximal set of disjoint triangles such that the vertices of each triangle are on three distinct sites. The segment Delaunay triangulation of . is the segment triangulation of . whose faces are inscribable in circles whose interiors do not intersect .. It 作者: Lignans 時(shí)間: 2025-3-31 05:32 作者: neuron 時(shí)間: 2025-3-31 11:05
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problemcollection of at most . sets whose union contains the maximum number of elements from the ground set. This is a fundamental combinatorial optimization problem with applications to resource allocation. We study the simplest APX-hard variant of the problem where all sets are of size at most 3 and we p作者: intelligible 時(shí)間: 2025-3-31 17:09 作者: 發(fā)生 時(shí)間: 2025-3-31 17:56 作者: Impugn 時(shí)間: 2025-4-1 00:30
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems} without two consecutive 1. Given a set . of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not . is a finite union of arithmetic progressions. We obtain a decision procedure under some
