咨询与建议

限定检索结果

文献类型

  • 281 篇 会议
  • 126 篇 期刊文献
  • 16 册 图书

馆藏范围

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

日期分布

学科分类号

  • 276 篇 工学
    • 216 篇 计算机科学与技术...
    • 159 篇 软件工程
    • 35 篇 信息与通信工程
    • 32 篇 控制科学与工程
    • 25 篇 电气工程
    • 17 篇 电子科学与技术(可...
    • 12 篇 机械工程
    • 12 篇 生物医学工程(可授...
    • 12 篇 生物工程
    • 11 篇 安全科学与工程
    • 7 篇 土木工程
    • 7 篇 网络空间安全
    • 6 篇 材料科学与工程(可...
    • 6 篇 石油与天然气工程
    • 5 篇 动力工程及工程热...
  • 144 篇 理学
    • 98 篇 数学
    • 20 篇 系统科学
    • 17 篇 生物学
    • 13 篇 物理学
    • 13 篇 统计学(可授理学、...
    • 7 篇 化学
  • 55 篇 管理学
    • 41 篇 管理科学与工程(可...
    • 23 篇 工商管理
    • 13 篇 图书情报与档案管...
  • 12 篇 教育学
    • 10 篇 教育学
  • 12 篇 医学
    • 10 篇 临床医学
    • 9 篇 基础医学(可授医学...
    • 6 篇 药学(可授医学、理...
  • 10 篇 经济学
    • 10 篇 应用经济学
  • 8 篇 法学
    • 8 篇 社会学
  • 6 篇 农学
  • 3 篇 文学
  • 2 篇 哲学
  • 2 篇 艺术学

主题

  • 24 篇 artificial intel...
  • 22 篇 computer science
  • 12 篇 software enginee...
  • 10 篇 semantics
  • 9 篇 application soft...
  • 9 篇 logic programmin...
  • 8 篇 programming prof...
  • 7 篇 information stor...
  • 6 篇 java
  • 6 篇 monitoring
  • 6 篇 hardware
  • 6 篇 middleware
  • 6 篇 equations
  • 5 篇 information syst...
  • 5 篇 libraries
  • 5 篇 parallel program...
  • 5 篇 laboratories
  • 5 篇 computer languag...
  • 5 篇 specifications
  • 5 篇 security

机构

  • 10 篇 department of sy...
  • 7 篇 department of ap...
  • 6 篇 programming meth...
  • 5 篇 department of co...
  • 5 篇 department of co...
  • 5 篇 department of co...
  • 5 篇 mart learning ed...
  • 4 篇 federal research...
  • 4 篇 department of co...
  • 4 篇 computer enginee...
  • 3 篇 german research ...
  • 3 篇 zuse institute b...
  • 3 篇 university of tw...
  • 3 篇 department of co...
  • 3 篇 rwth aachen univ...
  • 3 篇 research group p...
  • 3 篇 university of ka...
  • 3 篇 programming rese...
  • 3 篇 department of ap...
  • 3 篇 department of ap...

作者

  • 10 篇 fritzson peter
  • 8 篇 hayek ali
  • 7 篇 mostafa abotaleb
  • 7 篇 philippsen micha...
  • 6 篇 boercsoek josef
  • 6 篇 abdelhameed ibra...
  • 5 篇 el-sayed m.el-ke...
  • 5 篇 abdelaziz a.abde...
  • 5 篇 maiti manoranjan
  • 5 篇 de meuter wolfga...
  • 5 篇 henning christia...
  • 5 篇 doaa sami khafag...
  • 5 篇 roy abi zeid dao...
  • 5 篇 ali hayek
  • 4 篇 troels andreasen
  • 4 篇 choe km
  • 4 篇 scholz sven-bodo
  • 4 篇 bergstra j.a.
  • 4 篇 skiba alexander
  • 4 篇 daou roy abi zei...

语言

  • 415 篇 英文
  • 7 篇 其他
  • 1 篇 中文
检索条件"机构=Department of Computer science and Programming"
423 条 记 录,以下是351-360 订阅
排序:
An object-oriented language for symbolic computationapplied to machine element analysis  92
An object-oriented language for symbolic computationapplied ...
收藏 引用
1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992
作者: Viklund, Lars Fritzson, Peter Programming Environments Laboratory Department of Computer and Information Science Linköping University LinköpingS-581 83 Sweden
In this paper we present the ObjectMath language, a hybrid language integrating object-oriented constructs with features for symbolic and numeric computation. Complex mathematical models may be implemented in a natura... 详细信息
来源: 评论
Computing with lattices: An application of type classes
收藏 引用
Journal of Functional programming 1992年 第4期2卷 475-503页
作者: Jones, Mark P. Programming Research Group Oxford University UK Department of Computer Science Yale University Yale Station New Haven CT 06520-2158 PO Box 2158 United Kingdom
This paper presents a simple framework for performing calculations with the elements of (finite) lattices. A particular feature of this work is the use of type classes to enable the use of overloaded function symbols ...
来源: 评论
Double-exponential complexity of computing a complete set of AC-unifiers
Double-exponential complexity of computing a complete set of...
收藏 引用
Annual Symposium on Logic in computer science
作者: D. Kapur P. Narendran Institute of Programming and Logics Department of Computer Science State University of New York Albany Albany NY USA
An algorithm for computing a complete set of unifiers for two terms involving associative-commutative function symbols is presented. It is based on a nondeterministic algorithm given by the authors in 1986 to show the... 详细信息
来源: 评论
An efficient data interface for heterogeneous distributed environments
An efficient data interface for heterogeneous distributed en...
收藏 引用
International Conference on Distributed Computing Systems
作者: D.D.H. Lin B. Shirazi K. Kavi Personal Systems Programming Center IBM Corporation Austin TX USA Department of Computer Science Engineering University of Texas Arlington Arlington TX USA
A multi-language-based data interface system for heterogeneous distributed processing is introduced. A prototyped environment based on this system is discussed, and an evaluation of the prototyped system is presented.... 详细信息
来源: 评论
Formal Methods and Software Safety
收藏 引用
IFAC Proceedings Volumes 1992年 第30期25卷 93-98页
作者: J.P. Bowen V. Stavridou Oxford University Computing Laboratory Programming Research Group 11 Keble Road Oxford OX1 3QD UK Department of Computer Science Royal Holloway and Bedford New College University of London Egham Hill Egham Surrey TW20 0EX UK
The safety of software is becoming increasingly important as computers pervade control systems on which human life depends. Whilst hardware has become significantly more reliable over the years, the same cannot be sai... 详细信息
来源: 评论
A GLOBALLY CONVERGENT ALGORITHM FOR THE EUCLIDEAN MULTIPLICITY LOCATION PROBLEM
收藏 引用
Acta Mathematicae Applicatae Sinica 1992年 第4期8卷 357-366页
作者: J.B.ROSEN 薛国良 Computer Science Department University of MinnesotaMinneapolisMN 55455USA Institute of Operations Research Qufu Normal University Qufu 278165 Chinahe Euclidean single facility location problem (ESFL) and the Euclidean multiplicity lo-cation problem (EMFL) are two special nonsmooth convex programming problems which haveattracted a largr literature. For the ESFL problem. there are algorithms which converge bothglobally and quadratically For the EMFL problem there are some quadratically convergentalgorithms. but for global convergencel they all need nontrivial assumptions on the problem.In this paper we present an algorithm for EMFL. With no assumption on the problem it isproved that from any initial point this algorithm generates a sequence of points which convergesto the closed convex set of optimal solutions of EMFL.
The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity lo-cation problem (EMFL) are two special nonsmooth convex programming problems which haveattracted a largr literature. For the ESFL ... 详细信息
来源: 评论
Yet another efficient backward execution algorithm in the AND/OR process model
收藏 引用
Information Processing Letters 1992年 第3期43卷 165-165页
作者: Do-Hyung Kim Kwang-Moo Choe Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusung-Gu Taejon 305-701 South Korea
来源: 评论
YET ANOTHER EFFICIENT BACKWARD EXECUTION ALGORITHM IN THE AND OR PROCESS MODEL
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第4期40卷 201-211页
作者: KIM, DH CHOE, KM Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 371-1 Kusong-Dong Yusang-Gu Taejon 305-701 South Korea
An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during executio... 详细信息
来源: 评论
HOW WELL ARE NON-HORN CLAUSES HANDLED  6th
HOW WELL ARE NON-HORN CLAUSES HANDLED
收藏 引用
6TH INTERNATIONAL SYMP ON METHODOLOGIES FOR INTELLIGENT SYSTEMS ( ISMIS 91 )
作者: NIE, XM Institute for Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States
We analyze the search space of two clause-based proof procedures, the Model Elimination procedure and Near-Horn Prolog, both of Loveland. We study how the search space changes with respect to the degree of how “non-H... 详细信息
来源: 评论
A proof-theoretic approach to logic programming: II. Programs as definitions
收藏 引用
Journal of Logic and Computation 1991年 第5期1卷 635-660页
作者: Hallnäs, Lars Schroeder-Heister, Peter Programming Methodology Group Department of Computer Science Chalmers University of Technology Sweden Universitä Tübingen 7400 Tübingen Germany University Göteborg 412 96 Göteborg Sweden
We introduce a definitional extension of logic programming by means of an inference schema (Ph), which, in acertain sense, is dual to the (1-P) schema of rule application discussed in Part I. In the operational semant...
来源: 评论