咨询与建议

限定检索结果

文献类型

  • 580 篇 会议
  • 6 篇 期刊文献
  • 4 册 图书

馆藏范围

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

日期分布

学科分类号

  • 191 篇 工学
    • 188 篇 计算机科学与技术...
    • 116 篇 电气工程
    • 33 篇 软件工程
    • 7 篇 控制科学与工程
    • 4 篇 信息与通信工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 力学(可授工学、理...
    • 1 篇 材料科学与工程(可...
    • 1 篇 安全科学与工程
  • 69 篇 理学
    • 68 篇 数学
    • 3 篇 物理学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
  • 20 篇 经济学
    • 18 篇 理论经济学
    • 2 篇 应用经济学
  • 15 篇 管理学
    • 11 篇 管理科学与工程(可...
    • 10 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 1 篇 法学
    • 1 篇 社会学

主题

  • 289 篇 scientific compu...
  • 91 篇 computer science
  • 62 篇 cloud computing
  • 52 篇 computational mo...
  • 37 篇 polynomials
  • 34 篇 algorithm design...
  • 29 篇 algebra
  • 27 篇 computer archite...
  • 25 篇 testing
  • 24 篇 mathematics
  • 22 篇 software algorit...
  • 22 篇 complexity theor...
  • 22 篇 standards
  • 21 篇 electronic mail
  • 20 篇 grid computing
  • 20 篇 monitoring
  • 19 篇 semantics
  • 18 篇 application soft...
  • 18 篇 distributed comp...
  • 17 篇 concurrent compu...

机构

  • 11 篇 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 篇 davenport james ...
  • 5 篇 dorel lucanu
  • 5 篇 ardagna danilo
  • 5 篇 ciprian dobre
  • 5 篇 ruxandra stoean
  • 5 篇 stephen m. watt
  • 5 篇 florin pop

语言

  • 589 篇 英文
  • 1 篇 中文
检索条件"任意字段=9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"
590 条 记 录,以下是361-370 订阅
排序:
SYNASC 2009 - 11th international symposium on symbolic and numeric algorithms for scientific computing
SYNASC 2009 - 11th International Symposium on Symbolic and N...
收藏 引用
11th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2009
the proceedings contain 60 papers. the topics discussed include: SMT solvers for testing, program analysis and verification at Microsoft;automated methods for proving program termination and liveness;a hybrid algorith...
来源: 评论
SYNASC 2009 - 11th international symposium on symbolic and numeric algorithms for scientific computing: Preface
SYNASC 2009 - 11th International Symposium on Symbolic and N...
收藏 引用
SYNASC 2009 - 11th international symposium on symbolic and numeric algorithms for scientific computing 2009年 x-xi页
作者: Watt, Stephen M. Negru, Viorel Ida, Tetsuo Jebelean, Tudor Petcu, Dana Zaharie, Daniela
来源: 评论
A symbolic-numeric algorithm for computing the Alexander polynomial of a plane curve singularity
A symbolic-numeric algorithm for computing the Alexander pol...
收藏 引用
作者: Hodorog, MǍdǍlina Mourrain, Bernard Schicho, Josef Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstrasse 52 Linz Austria INRIA Sophia-Antipolis 2004 route des Lucioles 06902 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... 详细信息
来源: 评论
Proving partial correctness and termination of mutually recursive programs
Proving partial correctness and termination of mutually recu...
收藏 引用
作者: Popov, Nikolaj Jebelean, Tudor 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 disti...
来源: 评论
symbolic-numeric cooperation in an open science project
Symbolic-numeric cooperation in an open science project
收藏 引用
作者: San-Juan, Juan Félix López, Rosario López, Luis María Pérez, Iván Dpto. de Matemáticas y Computación Universidad de la Rioja 26004 Logroño Spain Dpto. de Ingeniería Mecánica Universidad de la Rioja 26004 Logroño Spain
this paper presents an overview of the initiative based on non-commercial software, which is being carried out in the University of La Rioja, to develop an e-Science and e-Learning Web-Site with the aim to encourage o... 详细信息
来源: 评论
Automatic improvements of Walli's inequality
Automatic improvements of Walli's inequality
收藏 引用
作者: Paule, Peter Pillwein, Veronika Research Institute for Symbolic Computation Johannes Kepler University Linz Austria
the mathematical backbone of this article is formed by three classical formulas of Wallis: his product formula for π, an inequality implying the product formula in the limit, and a related definite integral involving... 详细信息
来源: 评论
Optimization of resource scheduling in cloud computing
Optimization of resource scheduling in cloud computing
收藏 引用
作者: Li, Qiang Guo, Yike College of Computer Science Sichuan University Chengdu Sichuan 100056 China Department of Computer Science University of Tsukuba 305-8573 Japan Department of Computer Science Imperial College London SW7 2BZ United Kingdom
Resource scheduling based on SLA(Service Level Agreement) in cloud computing is NP-hard problem. there is no efficient method to solve it. this paper proposes a new method to solve the problem by applying stochastic i... 详细信息
来源: 评论
Personality filter in mobile networks with communication constraints
Personality filter in mobile networks with communication con...
收藏 引用
作者: Dimitrova, Maya Lekova, Anna Adda, Mo Institute of System Engineering and Robotics Bulgarian Academy of Sciences Sofia Bulgaria School of Computing University of Portsmouth Portsmouth United Kingdom
A new psychological model for efficient data transmission in mobile networks under communication constrains is proposed. It accounts for user personality characteristics to determine the feasible path for packet trans... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A purely logical approach to the termination of imperative loops
A purely logical approach to the termination of imperative l...
收藏 引用
作者: Eraşcu, MǍdǍlina Jebelean, Tudor Research Institute for Symbolic Computation Johannes Kepler University Linz Austria
We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. the conditions are (first-order) formulae obtained by certain transformations of... 详细信息
来源: 评论