咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
Soundness of a Logic-Based Verification Method for Imperative Loops
Soundness of a Logic-Based Verification Method for Imperativ...
收藏 引用
14th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Erascu, Madalina Jebelean, Tudor Johannes Kepler Univ Linz Symbol Computat Res Inst A-4040 Linz Austria
We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. the verification method consists in generating verification conditio... 详细信息
来源: 评论
Model-Driven Design of Cloud Applications with Quality-of-Service Guarantees: the MODAClouds Approach MICAS Tutorial  16
Model-Driven Design of Cloud Applications with Quality-of-Se...
收藏 引用
16th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: da Silva, Marcos Aurelio Almeida Ferry, Nicolas Ardagna, Danilo Perez, Juan F. Softeam Paris France SINTEF Trondheim Norway Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England
the competition between cloud providers has led to an impressive set of cloud solutions offered to consumers. the ability to properly design and deploy multi-cloud applications (i.e., applications deployed on multiple... 详细信息
来源: 评论
computing Origami Universal Molecules with Cyclic Tournament Forests
Computing Origami Universal Molecules with Cyclic Tournament...
收藏 引用
15th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Bowers, John C. Streinu, Ileana Univ Massachusetts Sch Comp Sci Amherst MA 01003 USA Smith Coll Dept Comp Sci Northampton MA 01063 USA
Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relatio... 详细信息
来源: 评论
Service lifecycle in the cloud environment
Service lifecycle in the cloud environment
收藏 引用
14th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Munteanu, Victor Ion Fortis, Teodor-Florin Negru, Viorel West Univ Timisoara Fac Math & Informat Dept Comp Sci Timisoara Romania
Cloud governance's approach to development in the cloud environment allows for a way in which services are well defined and unambiguous;where they can be easily designed, implemented, deployed and executed;for a w... 详细信息
来源: 评论
computing Boolean Border Bases  18
Computing Boolean Border Bases
收藏 引用
18th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Horacek, Jan Kreuzer, Martin Ekossono, Ange-Salome Messeng Univ Passau Fac Informat & Math D-94030 Passau Germany
Given a 0-dimensional polynomial system in a polynomial ring over F-2 having only. F-2-rational solutions, we optimize the Border Basis Algorithm (BBA) for solving this system by introducing a Boolean BBA. this algori... 详细信息
来源: 评论
Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach
Reachability Analysis of Time Basic Petri Nets: a Time Cover...
收藏 引用
13th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Bellettini, Carlo Capra, Lorenzo Univ Milan Dept Informat & Commun Milan Italy
We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real-time systems where time constraints are expressed as intervals, representing possible transition firing t... 详细信息
来源: 评论
Specifications and verification of network protocols by process algebra
Specifications and verification of network protocols by proc...
收藏 引用
7th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2005
作者: Ciobanu, Gabriel Sridhar, K.N. Research Institute e-Austria Timişoara Romania Romanian Academy Institute of Computer Science Iaşi Romania National University of Singapore School of Computing
this paper describes the specification and verification techniques for network protocols, concentrating on one hand on process algebras, and on the other hand on techniques for specific layers. the original contributi... 详细信息
来源: 评论
Colored petri nets state-space reduction via symbolic execution
Colored petri nets state-space reduction via symbolic execut...
收藏 引用
7th international symposium on symbolic and numeric algorithms for scientific computing
作者: Capra, L Univ Milan Dip Informat & Comunicaz I-20135 Milan Italy
State-space reduction techniques for distributed discrete-event systems are normally based on detection of behavioral equivalences or symmetries. Well-Formed Nets (WN) are a Colored Petri Net flavor allowing the direc... 详细信息
来源: 评论
Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions  24
Comparison of OLS and NLS to fit Transformation-Interaction-...
收藏 引用
24th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: de Franca, Fabricio Olivetti Univ Fed ABC Ctr Math Comp & Cognit CMCC Heurist & Anal Lab HAL Santo Andre Brazil
Transformation-Interaction-Rational is a representation for symbolic Regression created with the intent to constrain the search space of mathematical expressions with only simple models. In short, this representation ... 详细信息
来源: 评论
computing Self-intersection Loci of Parametrized Surfaces Using Regular Systems and Grobner Bases
Computing Self-intersection Loci of Parametrized Surfaces Us...
收藏 引用
11th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Huang, Yanli Wang, Dongming Beihang Univ LMIB SKLSDE Sch Math & Syst Sci Beijing 100191 Peoples R China Univ Paris 06 Lab Informat CNRS F-75016 Paris France
the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two g... 详细信息
来源: 评论