標(biāo)題: Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Jacques Calmet,Carla Limongelli Conference proceedings 1996 [打印本頁(yè)] 作者: ergonomics 時(shí)間: 2025-3-21 19:04
書(shū)目名稱Design and Implementation of Symbolic Computation Systems影響因子(影響力)
書(shū)目名稱Design and Implementation of Symbolic Computation Systems影響因子(影響力)學(xué)科排名
書(shū)目名稱Design and Implementation of Symbolic Computation Systems網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Design and Implementation of Symbolic Computation Systems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Design and Implementation of Symbolic Computation Systems被引頻次
書(shū)目名稱Design and Implementation of Symbolic Computation Systems被引頻次學(xué)科排名
書(shū)目名稱Design and Implementation of Symbolic Computation Systems年度引用
書(shū)目名稱Design and Implementation of Symbolic Computation Systems年度引用學(xué)科排名
書(shū)目名稱Design and Implementation of Symbolic Computation Systems讀者反饋
書(shū)目名稱Design and Implementation of Symbolic Computation Systems讀者反饋學(xué)科排名
作者: indignant 時(shí)間: 2025-3-21 22:49
Design and Implementation of Symbolic Computation SystemsInternational Sympos作者: interlude 時(shí)間: 2025-3-22 01:56 作者: 定點(diǎn) 時(shí)間: 2025-3-22 04:43
978-3-540-61697-9Springer-Verlag Berlin Heidelberg 1996作者: 得罪人 時(shí)間: 2025-3-22 12:27 作者: 粉筆 時(shí)間: 2025-3-22 14:27 作者: 粉筆 時(shí)間: 2025-3-22 19:01
Equality elimination for the tableau method,rposition calculus. Unlike most other known methods of adding equality to semantic tableaux, equality elimination does not use simultaneous rigid .-unification or its modifications. For controlling redundancy, we can use powerful strategies of subsumption and simplification. We also make an extensive comparison with related works in the area.作者: 媽媽不開(kāi)心 時(shí)間: 2025-3-22 21:31
Parameterizing object specifications,o describe the part of the world to be modeled as an object community of concurrently existing and communicating objects. Our proposal for parameter passing works well on the syntactical level by means of a pushout construction. On the semantic level we use free constructions and corresponding forgetful functors.作者: exorbitant 時(shí)間: 2025-3-23 04:39 作者: arrhythmic 時(shí)間: 2025-3-23 06:32
Walking faster,ct to another term order. The conversion is done in several steps (the walk) following a path in the Gr?bner fan of .. We report on our experiences with an implementation of the walk. We discuss several algorithmic variations as well as important implementation techniques whose combined effect is to elevate the walk to a new level of performance.作者: 顯而易見(jiàn) 時(shí)間: 2025-3-23 10:40
Document-centered presentation of computing software: Compound documents are better workspaces,ematical software into components, and the direct manipulation of workspaces is an improvement over name bindings. Further, document parts can act as placeholders for upcoming results. Viewing document parts within a textual context allows scripting within documents.作者: 消滅 時(shí)間: 2025-3-23 16:41 作者: alleviate 時(shí)間: 2025-3-23 20:15
Lothar Geitler,Elisabeth Tschermak-Woessrposition calculus. Unlike most other known methods of adding equality to semantic tableaux, equality elimination does not use simultaneous rigid .-unification or its modifications. For controlling redundancy, we can use powerful strategies of subsumption and simplification. We also make an extensive comparison with related works in the area.作者: 盤(pán)旋 時(shí)間: 2025-3-24 01:15
Saponins of Ginseng and Related Plants,o describe the part of the world to be modeled as an object community of concurrently existing and communicating objects. Our proposal for parameter passing works well on the syntactical level by means of a pushout construction. On the semantic level we use free constructions and corresponding forgetful functors.作者: PLUMP 時(shí)間: 2025-3-24 04:34 作者: 初次登臺(tái) 時(shí)間: 2025-3-24 07:33 作者: 加劇 時(shí)間: 2025-3-24 14:03
Friedrich H. W. Heuck,Elmar Keckematical software into components, and the direct manipulation of workspaces is an improvement over name bindings. Further, document parts can act as placeholders for upcoming results. Viewing document parts within a textual context allows scripting within documents.作者: Musculoskeletal 時(shí)間: 2025-3-24 15:45 作者: murmur 時(shí)間: 2025-3-24 21:14
Morphologie einschlie?lich Anatomieimplementations of key algorithms for linear ordinary differential and (.)-difference equations to scientific programmers and to computer algebra system users, regardless of the programming language or interactive system they use. As such, Σ. is not a computer algebra system per se, but a library (o作者: trigger 時(shí)間: 2025-3-25 03:04 作者: Rodent 時(shí)間: 2025-3-25 07:19 作者: Throttle 時(shí)間: 2025-3-25 09:24
L. Zechmeister,Y. Asahina,G. Zempléns own computation. Implementing meta-computation by high-level language enables us to access meta-level with high-abstract interface. In recent years this notion can be found in several fields of computer science and artificial intelligence. In particular, in the field of intelligent systems meta-co作者: Fluctuate 時(shí)間: 2025-3-25 15:38
A. Butenandt,U. Westphal,Th. Wielands and contexts and 2-morphisms represent reduction rules. In this context stability and compatibility properties of reduction can be proved. The proposed categorial view allows for a good level of expressivity of the reduction mechanisms, without constraining rewriting to the particular area where i作者: 裝飾 時(shí)間: 2025-3-25 19:48 作者: 和平主義 時(shí)間: 2025-3-25 22:37 作者: 煞費(fèi)苦心 時(shí)間: 2025-3-26 02:56
https://doi.org/10.1007/978-3-7091-8656-5ies and Domains may contain conditionals in their bodies, which are elaborated by our compiler by techniques used in standard typing. We define an appropriate calculus and discuss its properties. Examples inspired by the Axiom library illustrate the power of our approach and its application in const作者: Basal-Ganglia 時(shí)間: 2025-3-26 07:22 作者: 高原 時(shí)間: 2025-3-26 11:41
https://doi.org/10.1007/978-3-7091-9242-9hemical metaphor is given to Z. Then, some Unity-like temporal logic constructs are defined on such a formal operational semantics in order to allow the specification and analysis of dynamic and temporal properties of concurrent systems, such as safety and liveness properties.作者: institute 時(shí)間: 2025-3-26 14:02 作者: 平 時(shí)間: 2025-3-26 18:14
G. W. Beadle,F. E. Brauns,R. S. Rasmussen one obtains linear speed-up (up to 29 times), using a serial-parallel scheme. A two-dimensional algorithm for multiplication of polynomials gives half-linear speed-up (up to 383 times). We also implement multiprecision rational arithmetic using known systolic algorithms for addition and multiplicat作者: seduce 時(shí)間: 2025-3-26 23:40 作者: 開(kāi)花期女 時(shí)間: 2025-3-27 03:07 作者: 詞匯表 時(shí)間: 2025-3-27 05:37 作者: 蜿蜒而流 時(shí)間: 2025-3-27 09:42
Friedrich H. W. Heuck,Elmar Keckematical software into components, and the direct manipulation of workspaces is an improvement over name bindings. Further, document parts can act as placeholders for upcoming results. Viewing document parts within a textual context allows scripting within documents.作者: sleep-spindles 時(shí)間: 2025-3-27 15:27 作者: entitle 時(shí)間: 2025-3-27 19:10
DiscAtinf: A general framework for implementing calculi and strategies,nt a large class of computational systems (proof procedures, constraints solving algorithms...) are presented. Systems are described by sets of rules along with a strategy to guide the application of these rules. This formalism has been chosen because it fits well to the standard mathematical practi作者: DEMUR 時(shí)間: 2025-3-27 22:57 作者: foliage 時(shí)間: 2025-3-28 04:56
A reflective language based on conditional term rewriting,s own computation. Implementing meta-computation by high-level language enables us to access meta-level with high-abstract interface. In recent years this notion can be found in several fields of computer science and artificial intelligence. In particular, in the field of intelligent systems meta-co作者: adequate-intake 時(shí)間: 2025-3-28 09:54 作者: 可互換 時(shí)間: 2025-3-28 12:12 作者: MULTI 時(shí)間: 2025-3-28 15:36
Exploiting SML for experimenting with algebraic algorithms: The example of ,-adic lifting,special application of the .-adic lifting technique, the Hensel algorithm, that is utilized in a symbolic but also numeric context. This experiment demonstrates that SML provides a suitable frame for the implementation of abstract algebraic notions together with the possibility to code related algor作者: Homocystinuria 時(shí)間: 2025-3-28 21:38
Conditional categories and domains,ies and Domains may contain conditionals in their bodies, which are elaborated by our compiler by techniques used in standard typing. We define an appropriate calculus and discuss its properties. Examples inspired by the Axiom library illustrate the power of our approach and its application in const作者: Gastric 時(shí)間: 2025-3-28 23:20
Parameterizing object specifications,o describe the part of the world to be modeled as an object community of concurrently existing and communicating objects. Our proposal for parameter passing works well on the syntactical level by means of a pushout construction. On the semantic level we use free constructions and corresponding forge作者: asthma 時(shí)間: 2025-3-29 06:01
Analyzing the dynamics of a Z specification,hemical metaphor is given to Z. Then, some Unity-like temporal logic constructs are defined on such a formal operational semantics in order to allow the specification and analysis of dynamic and temporal properties of concurrent systems, such as safety and liveness properties.作者: analogous 時(shí)間: 2025-3-29 08:39 作者: Glucose 時(shí)間: 2025-3-29 15:21
Integer and rational arithmetic on masPar, one obtains linear speed-up (up to 29 times), using a serial-parallel scheme. A two-dimensional algorithm for multiplication of polynomials gives half-linear speed-up (up to 383 times). We also implement multiprecision rational arithmetic using known systolic algorithms for addition and multiplicat作者: intrude 時(shí)間: 2025-3-29 16:37 作者: genuine 時(shí)間: 2025-3-29 21:30
A master-slave approach to parallel term rewriting on a hierarchical multiprocessor,ept integrates distributed search parallelism on the network, based on a master-slave approach, with the parallel execution of each search on a multiprocessor. Both levels of parallelism are realized by a uniform fork /join paradigm using multi-threading. In many of our examples we are able to combi作者: Regurgitation 時(shí)間: 2025-3-30 03:16 作者: myriad 時(shí)間: 2025-3-30 08:00
Document-centered presentation of computing software: Compound documents are better workspaces,ematical software into components, and the direct manipulation of workspaces is an improvement over name bindings. Further, document parts can act as placeholders for upcoming results. Viewing document parts within a textual context allows scripting within documents.作者: NICE 時(shí)間: 2025-3-30 11:31
Conference proceedings 1996‘96, held in Karlsruhe, Germany, in September 1996..The volume includes four invited contributions surveying the state of the art in a particular subfield or pointing to some new research directions together with 31 revised full papers selected from a total of some 70 submissions. Many current aspec作者: 牽連 時(shí)間: 2025-3-30 13:05 作者: Subjugate 時(shí)間: 2025-3-30 18:57
Morphologie einschlie?lich Anatomieem users, regardless of the programming language or interactive system they use. As such, Σ. is not a computer algebra system per se, but a library (or substrate) which is designed to be “plugged” with minimal efforts into different types of client applications.作者: 有常識(shí) 時(shí)間: 2025-3-30 21:24
A. Butenandt,U. Westphal,Th. Wielandsed categorial view allows for a good level of expressivity of the reduction mechanisms, without constraining rewriting to the particular area where it is defined. Moreover, it seems to be a promising framework for the embedding of algebraic reduction.作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-3-31 04:09
https://doi.org/10.1007/978-3-7091-7188-2monstrates that SML provides a suitable frame for the implementation of abstract algebraic notions together with the possibility to code related algorithms in a generic way on the corresponding level of abstraction.作者: synchronous 時(shí)間: 2025-3-31 08:48 作者: STYX 時(shí)間: 2025-3-31 11:01
E. Grube,H. Becher,B. Backs,D. Schmidtrocessor. Both levels of parallelism are realized by a uniform fork /join paradigm using multi-threading. In many of our examples we are able to combine the benefits of distributed and shared-memory approaches for superior overall speed-ups.作者: Retrieval 時(shí)間: 2025-3-31 13:23 作者: MEET 時(shí)間: 2025-3-31 20:54 作者: Minutes 時(shí)間: 2025-4-1 01:42
A reflective language based on conditional term rewriting,mputation is often called meta-inference and plays an important role for designing complex systems. We introduce reflective-computation mechanisms into a conditional term rewriting system-based language and discuss about their implementation and application.
