咨询与建议

限定检索结果

文献类型

  • 5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 5 篇 algorithm correc...
  • 1 篇 distributed opti...
  • 1 篇 berlekamp's meth...
  • 1 篇 convex optimizat...
  • 1 篇 re-usable algori...
  • 1 篇 program synthesi...
  • 1 篇 algorithm scheme...
  • 1 篇 merge-sort
  • 1 篇 conjecture gener...
  • 1 篇 merging
  • 1 篇 numerical comput...
  • 1 篇 decimal notation
  • 1 篇 cyber physical s...
  • 1 篇 large
  • 1 篇 sorting
  • 1 篇 foundation of ma...
  • 1 篇 embedded systems
  • 1 篇 addition
  • 1 篇 computational ge...
  • 1 篇 visibility

机构

  • 1 篇 univ wisconsin m...
  • 1 篇 natl chiao tung ...
  • 1 篇 department of en...
  • 1 篇 department of co...
  • 1 篇 risc - research ...

作者

  • 1 篇 notarnicola ivan...
  • 1 篇 joe b
  • 1 篇 adrian crăciun
  • 1 篇 bruno buchberger
  • 1 篇 notarstefano giu...
  • 1 篇 yang w
  • 1 篇 musser dr

语言

  • 4 篇 英文
  • 1 篇 其他
检索条件"主题词=algorithm correctness"
5 条 记 录,以下是1-10 订阅
A Duality-Based Approach for Distributed Optimization with Coupling Constraints
收藏 引用
IFAC-PapersOnLine 2017年 第1期50卷 14326-14331页
作者: Notarnicola, Ivano Notarstefano, Giuseppe Department of Engineering Università del Salento Lecce Italy
In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constrain... 详细信息
来源: 评论
algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema
收藏 引用
Electronic Notes in Theoretical Computer Science 2004年 93卷 24-59页
作者: Bruno Buchberger Adrian Crăciun RISC - Research Institute for Symbolic Computation Johannes Kepler University Linz Austria
Recently, we proposed a systematic method for top-down synthesis and verification of lemmata and algorithms called “lazy thinking method” as a part of systematic mathematical theory exploration (mathematical knowled... 详细信息
来源: 评论
Why is 1+1=2?
收藏 引用
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2002年 第3期18卷 425-443页
作者: Yang, W Natl Chiao Tung Univ Dept Comp & Informat Sci Hsinchu 300 Taiwan
Too often we take the method of decimal addition to be the definition of addition. We clarify this misunderstanding by first giving a definition of addition and then proving that the decimal addition method is both so... 详细信息
来源: 评论
ON THE correctness OF A LINEAR-TIME VISIBILITY POLYGON algorithm
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年 第3-4期32卷 155-172页
作者: JOE, B Department of Computing Science University of Alberta Edmonton Alberta T6G 2HI Canada
We prove the correctness of the linear-time algorithm in Joe and Simpson [7] for computing the visibility polygon of a simple polygon from a viewpoint that is either interior to the polygon or in its blocked exterior.... 详细信息
来源: 评论
MULTIVARIATE POLYNOMIAL FACTORIZATION
收藏 引用
JOURNAL OF THE ACM 1975年 第2期22卷 291-308页
作者: MUSSER, DR UNIV WISCONSIN MADISON WI 53706 USA
This paper describes algorithms for factoring a polynomial in one or more variables, with integer coefficients, into factors which are irreducible over the integers These algorithms are based on the use of factorIzatm... 详细信息
来源: 评论