咨询与建议

限定检索结果

文献类型

  • 559 篇 会议
  • 7 篇 期刊文献
  • 5 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

  • 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

语言

  • 571 篇 英文
检索条件"任意字段=8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"
571 条 记 录,以下是411-420 订阅
排序:
A Depth-first Algorithm to Reduce Graphs in Linear Time
A Depth-first Algorithm to Reduce Graphs in Linear Time
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Miklos Bartha Miklos Kresz Department of Computer Science Memorial University of Newfoundland Saint John's NB Canada Faculty of Education University of Szeged Szeged Hungary
A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its re... 详细信息
来源: 评论
m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations
m-Hilbert Polynomial and Arbitrariness of the General Soluti...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Qi Ding Hongqing Zhang School of Mathematical Science Dalian University of Technology Dalian China
Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's ... 详细信息
来源: 评论
On the Existence of Complete Disjoint NP-Pairs
On the Existence of Complete Disjoint NP-Pairs
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Olaf Beyersdorff Institut für Informatik Humboldt-Universität zu Berlin Berlin Germany
Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. the question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 a... 详细信息
来源: 评论
Sparse Matrix Computations Using the Quadtree Storage Format
Sparse Matrix Computations Using the Quadtree Storage Format
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Ivan Simecek Department of Computer Science and Engineering Czech Technical University Prague Czech Republic
Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance. Efficient formats for storing sparse matrices are still under development, since the computat... 详细信息
来源: 评论
Factorizations of Regular Hedge Languages
Factorizations of Regular Hedge Languages
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Mircea Marin Adrian Craciun Department of Computer Science University of Tsukuba Tsukuba Japan Department of Computer Science West University of Timişoara Timisoara Romania
Regular hedge languages are an extension of regular tree languages that received renewed attention since their recognition as a formal model of XML schemata. they share several properties with regular languages, but t... 详细信息
来源: 评论
Simplification and Generalization in CIRC
Simplification and Generalization in CIRC
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Eugen-Ioan Goriac Georgiana Caltais Dorel Lucanu Faculty of Computer Science Alexandru Ioan Cuza슠University Iasi Romania
CIRC is an automated theorem prover based on the circular coinduction principle. the tool is used for the verification of programs, behavioral equivalence checking, and proving properties over infinite data structures... 详细信息
来源: 评论
Using a fUML Action Language to Construct UML Models
Using a fUML Action Language to Construct UML Models
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Codrut Lucian Lazar Ioan Lazar Bazil Parv Simona Motogna Istvan Gergely Czibula Dept. of Comput. Sci. Babes-Bolyai Univ. Cluj-Napoca Romania Department of Computer Science Babe-Bolyai University Cluj-Napoca Romania
In this paper we introduce a fUML based action language and describe its concrete syntax. the action language uses only elements allowed by the fUML standard for its abstract syntax. the concrete syntax resembles the ... 详细信息
来源: 评论
Superfluous S-polynomials in Strategy-Independent Groebner Bases
Superfluous S-polynomials in Strategy-Independent Groebner B...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Grant Olney Passmore Leonardo de Moura LFCS University of Edinburgh Edinburgh UK Microsoft Research Limited Redmond WA USA
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures a... 详细信息
来源: 评论
Solving Nonsmooth Interval Equations with Slopes
Solving Nonsmooth Interval Equations with Slopes
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Rongfen Lin Hao Jiang Lizhi Cheng School of Science National University of Defense Technology Changsha China
In this paper, the problem of finding all zeros of an continuously interval function in a given interval is considered. A new method for solving this problem is proposed. It is based on the idea of isolating the endpo... 详细信息
来源: 评论
Finding the Solutions of Nonlinear Equation Systems from an Interval
Finding the Solutions of Nonlinear Equation Systems from an ...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Cristian Cira Mihai Fac. of Exact Sci. Aurel Vlaicu Univ. of Arad Arad Romania
the paper describes an algorithm that determines the solutions of a n-dimensional nonlinear equation system within a given interval. the result is based on Semenov algorithm that isolates the solutions and improves up... 详细信息
来源: 评论