咨询与建议

限定检索结果

文献类型

  • 565 篇 会议
  • 7 篇 期刊文献
  • 2 册 图书

馆藏范围

  • 574 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 176 篇 工学
    • 173 篇 计算机科学与技术...
    • 108 篇 电气工程
    • 28 篇 软件工程
    • 5 篇 控制科学与工程
    • 4 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 材料科学与工程(可...
    • 1 篇 电子科学与技术(可...
  • 59 篇 理学
    • 59 篇 数学
    • 2 篇 物理学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
  • 19 篇 经济学
    • 18 篇 理论经济学
    • 1 篇 应用经济学
  • 12 篇 管理学
    • 8 篇 管理科学与工程(可...
    • 7 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 1 篇 法学
    • 1 篇 社会学

主题

  • 290 篇 scientific compu...
  • 91 篇 computer science
  • 64 篇 cloud computing
  • 51 篇 computational mo...
  • 36 篇 polynomials
  • 34 篇 algorithm design...
  • 28 篇 algebra
  • 27 篇 computer archite...
  • 25 篇 mathematics
  • 25 篇 testing
  • 22 篇 software algorit...
  • 22 篇 complexity theor...
  • 21 篇 electronic mail
  • 20 篇 monitoring
  • 20 篇 standards
  • 19 篇 grid computing
  • 19 篇 semantics
  • 18 篇 application soft...
  • 18 篇 distributed comp...
  • 17 篇 concurrent compu...

机构

  • 10 篇 research institu...
  • 8 篇 tech univ cluj n...
  • 7 篇 department of co...
  • 7 篇 faculty of infor...
  • 6 篇 faculty of mathe...
  • 6 篇 department of co...
  • 6 篇 faculty of compu...
  • 5 篇 department of co...
  • 5 篇 department of co...
  • 5 篇 computer science...
  • 4 篇 department of co...
  • 4 篇 nicolaus coperni...
  • 4 篇 research institu...
  • 4 篇 institute e-aust...
  • 4 篇 department of co...
  • 4 篇 romanian acad in...
  • 4 篇 computer science...
  • 4 篇 faculty of autom...
  • 3 篇 department of co...
  • 3 篇 department of co...

作者

  • 9 篇 gabriel ciobanu
  • 8 篇 adina magda flor...
  • 7 篇 petcu dana
  • 7 篇 james h. davenpo...
  • 7 篇 jebelean tudor
  • 7 篇 eneia nicolae to...
  • 7 篇 nebojsa bacanin
  • 7 篇 tudor jebelean
  • 6 篇 catalin stoean
  • 6 篇 ciobanu gabriel
  • 6 篇 nicolae tapus
  • 6 篇 valentin cristea
  • 5 篇 mugurel ionut an...
  • 5 篇 dorel lucanu
  • 5 篇 ardagna danilo
  • 5 篇 ciprian dobre
  • 5 篇 ruxandra stoean
  • 5 篇 stephen m. watt
  • 5 篇 florin pop
  • 5 篇 simson daniel

语言

  • 574 篇 英文
检索条件"任意字段=7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"
574 条 记 录,以下是211-220 订阅
排序:
Toward Non-flat Geometrical Origami Folds with Eos System
Toward Non-flat Geometrical Origami Folds with Eos System
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Fadoua Ghourabi Computer Science Department Ochanomizu University Tokyo Japan
the goal of this research is to perform origami geometric constructions in the 3D space using the symbolic computation capabilities in the computational origami system Eos. In this paper, we explain the formalization ... 详细信息
来源: 评论
Properties of Multisets Compared to Sets
Properties of Multisets Compared to Sets
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Aurelian Radoaca Department of Computer Science West University of Timisoara Romania
We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and mul... 详细信息
来源: 评论
Complementaries of Greek Means with Respect to the Logarithmic Mean
Complementaries of Greek Means with Respect to the Logarithm...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Iulia Costin Department of Computer Science Technical University of UTCN Cluj-Napoca Romania
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in s... 详细信息
来源: 评论
the Sparsity Challenges
The Sparsity Challenges
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: James Harold Davenport Jacques Carette Department of Computer Science University of Bath Bath UK Department of Computing and Software McMaster University Hamilton ONT Canada
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a... 详细信息
来源: 评论
Proving Partial Correctness and Termination of Mutually Recursive Programs
Proving Partial Correctness and Termination of Mutually Recu...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Nikolaj Popov Tudor Jebelean Research Institute for Symbolic Computation Johannes Kepler University Linz Austria
We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a dist... 详细信息
来源: 评论
On Herbrand-like theorems for Cut-free Modal Sequent Logics
On Herbrand-like Theorems for Cut-free Modal Sequent Logics
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Alexander Lyaletski Faculty of Cybernetics Taras Shevchenko National University of Kiev Kyiv Ukraine
the purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent l... 详细信息
来源: 评论
Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm
Extreme Points of the Unit Ball B4 in the Space of Real Poly...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Jan-Michael Holzinger Robert Vajda Linz School of Education Johannes Kepler University Linz Austria
Denote by P n the space of real polynomials p of degree at most n equipped with the sup norm on the interval I = [−1, 1]. the unit ball B n with respect to the sup norm is a compact convex set. Let EB n denote the ... 详细信息
来源: 评论
Intelligent Computer Mathematics - 9th international Conference, AISC 2008 - 15th symposium, Calculemus 2008 - 7th international Conference, MKM 2008, Proceedings
Intelligent Computer Mathematics - 9th International Confere...
收藏 引用
9th Int. Conf. Artificial Intelligence and symbolic Computation, AISC 2008 - 15th symposium on the Integration of symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008
the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism i... 详细信息
来源: 评论
Coverability Problems for Jumping Petri Nets
Coverability Problems for Jumping Petri Nets
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Cristian Vidrascu Faculty of Computer Science University Al. I. Cuza of Iaşi Iasi Romania
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable ... 详细信息
来源: 评论
A symbolic-numeric Algorithm for computing the Alexander Polynomial of a Plane Curve Singularity
A Symbolic-Numeric Algorithm for Computing the Alexander Pol...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Madalina Hodorog Bernard Mourrain Josef Schicho Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Linz Austria I.N.R.I.A. Sophia Antipolis Sophia-Antipolis France
We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficie... 详细信息
来源: 评论