检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

180 篇 会议
18 篇 期刊文献
3 册 图书

馆藏范围

201 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

148 篇 工学
- 133 篇 计算机科学与技术...
- 94 篇 软件工程
- 7 篇 电气工程
- 7 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 3 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 城乡规划学
- 1 篇 生物工程
- 1 篇 安全科学与工程
27 篇 理学
- 24 篇 数学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 物理学
12 篇 管理学
- 6 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
- 1 篇 作物学

主题

32 篇 logic programmin...
23 篇 functional progr...
9 篇 logic
8 篇 programming
6 篇 computer science
6 篇 parallel program...
6 篇 answer set progr...
5 篇 computer circuit...
5 篇 application soft...
5 篇 optimization
5 篇 semantics
5 篇 computer program...
5 篇 probabilistic lo...
5 篇 hardware
4 篇 programming prof...
4 篇 computer archite...
4 篇 model checking
4 篇 logic gates
4 篇 linear programmi...
4 篇 yarn

机构

2 篇 univ london impe...
2 篇 vienna universit...
2 篇 university of ca...
2 篇 department of co...
2 篇 imdea software
2 篇 texas tech univ ...
2 篇 free univ bolzan...
2 篇 queen mary univ ...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 tech univ madrid...
2 篇 tech univ madrid...
2 篇 univ roma la sap...
2 篇 national ict aus...
2 篇 univ calabria di...
2 篇 vienna univ tech...
1 篇 philipps univ ma...
1 篇 univ nottingham ...
1 篇 dept of comput u...
1 篇 univ porto cracs...

作者

3 篇 yoshida nobuko
3 篇 woltran stefan
3 篇 saenz-perez fern...
2 篇 stuckey peter j.
2 篇 mellarkod veena ...
2 篇 lópez-garcía p
2 篇 mukaidono masao
2 篇 kiselyov oleg
2 篇 hafiz rahmatulla...
2 篇 krennwallner tho...
2 篇 costa vitor sant...
2 篇 lenzerini mauriz...
2 篇 cozman fabio g.
2 篇 caballero rafael
2 篇 carro manuel
2 篇 eiter thomas
2 篇 rosati riccardo
2 篇 rodríguez-artale...
2 篇 frost richard a.
2 篇 ianni giovambatt...

语言

193 篇 英文
7 篇 其他
1 篇 西班牙文

检索条件"任意字段=10th International Symposium on Functional and Logic Programming"

共 201 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Decidable Multi-agent logic with Iterations of Upper and Lower Probability Operators 10th

A Decidable Multi-agent Logic with Iterations of Upper and L...

引用

10th international symposium on Foundations of Information and Knowledge Systems (FoIKS)

作者： Doder, Dragan Savic, Nenad Ognjanovic, Zoran Univ Paul Sabatier IRIT CNRS 118 Route Narbonne F-31062 Toulouse 9 France Univ Bern Inst Comp Sci Neubrueckstr 10 CH-3012 Bern Switzerland Serbian Acad Arts & Sci Math Inst Kneza Mihaila 36 Belgrade 11000 Serbia

ISBN: (纸本)9783319900506;9783319900490

We present a propositional logic for reasoning about higher-order upper and lower probabilities. the main technical result is the proof of decidability of the introduced logical system. We also show that the axiomatization for the corresponding logic without iterations of operators, which we developed in our previous work, is also complete for the new class of models presented in this paper.

关键词： Probabilistic logic Upper and lower probabilities Decidability Completeness theorem

来源：评论

学校读者我要写书评

暂无评论

Enumeration Complexity of Poor Man's Propositional Dependence logic 10th

Enumeration Complexity of Poor Man's Propositional Dependenc...

引用

10th international symposium on Foundations of Information and Knowledge Systems (FoIKS)

作者： Meier, Arne Reinbold, Christian Leibniz Univ Hannover Inst Theoret Informat Appelstr 4 D-30167 Hannover Germany

ISBN: (纸本)9783319900506;9783319900490

Dependence logics are a modern family of logics of independence and dependence which mimic notions of database theory. In this paper, we aim to initiate the study of enumeration complexity in the field of dependence logics and thereby get a new point of view on enumerating answers of database queries. Consequently, as a first step, we investigate the problem of enumerating all satisfying teams of formulas from a given fragment of propositional dependence logic. We distinguish between restricting the team size by arbitrary functions and the parametrised version where the parameter is the team size. We show that a polynomial delay can be reached for polynomials and otherwise in the parametrised setting we reach FPT delay. However, the constructed enumeration algorithm with polynomial delay requires exponential space. We show that an incremental polynomial delay algorithm exists which uses polynomial space only. Negatively, we show that for the general problem without restricting the team size, an enumeration algorithm running in polynomial space cannot exist.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

10th international Working Conference on Verified Software: theories, Tools, and Experiments, VSTTE 2018

10th International Working Conference on Verified Software: ...

引用

10th international Working Conference on Verified Software: theories, Tools, and Experiments, VSTTE 2018

ISBN: (纸本)9783030035914

the proceedings contain 19 papers. the special focus in this conference is on Verified Software: theories, Tools, and Experiments. the topics include: Constructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing Between Black-Box Components;sideTrail: Verifying Time-Balancing of Cryptosystems;towards Verification of Ethereum Smart Contracts: A Formalization of Core of Solidity;relational Equivalence Proofs Between Imperative and MapReduce Algorithms;practical Methods for Reasoning About Java 8’s functional programming Features;verification of Binarized Neural Networks via Inter-neuron Factoring: (Short Paper);the Map Equality Domain;loop Detection by logically Constrained Term Rewriting;store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment;executable Counterexamples in Software Model Checking;Extending VIAP to Handle Array Programs;lattice-Based Refinement in Bounded Model Checking;verified Certificate Checking for Counting Votes;program Verification in the Presence of I/O: Semantics, Verified Library Routines, and Verified Applications;TWAM: A Certifying Abstract Machine for logic Programs;a Java Bytecode Formalisation;formalising Executable Specifications of Low-Level Systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

10th international Conference on Reversible Computation, RC 2018

10th International Conference on Reversible Computation, RC ...

引用

10th international Conference on Reversible Computation, RC 2018

ISBN: (纸本)9783319994970

the proceedings contain 25 papers. the special focus in this conference is on Reversible Computation. the topics include: Quantum circuits for floating-point arithmetic;SAT-based {CNOT, T} quantum circuit synthesis;Ballistic reversible gates matched to bit storage: Plans for an efficient CNOT gate using fluxons;finding the redundant gates in reversible circuits;multi-objective synthesis of quantum circuits using genetic programming;quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures;QMDD-based one-pass design of reversible logic: Exploring the available degree of freedom (work-in-progress report);garbage-free reversible multiplication and division;data structures and dynamic memory management in reversible languages;from reversible semantics to reversible debugging;checkpoint/rollback vs causally-consistent reversibility;coreFun: A typed functional reversible core language;reversible object-oriented programming with region-based memory management: Work-in-progress report;encryption and reversible computations: Work-in-progress paper;a library of reversible circuit transformations (work in progress);reversibility in space, time, and computation: the case of underwater acoustic communications: Work in progress report;finite-state classical mechanics;on aperiodic reversible turing machines (invited talk);on reversibility and broadcast;reversible computation in petri nets;Event structure semantics of (controlled) reversible CCS;simulation of base excision repair in the calculus of covalent bonding;a unified approach to quantum computation and classical reversible computation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

10th international symposium on Search-Based Software Engineering, SSBSE 2018

10th International Symposium on Search-Based Software Engine...

引用

10th international symposium on Search-Based Software Engineering, SSBSE 2018

ISBN: (纸本)9783319992402

the proceedings contain 25 papers. the special focus in this conference is on . the topics include: Damage reduction via white-box failure shaping;automated co-evolution of metamodels and transformation rules: A search-based approach;learning without peeking: Secure multi-party computation genetic programming;towards minimizing the impact of changes using search-based approach;exploring evolutionary search strategies to improve applications’ energy efficiency;optimization experiments in the continuous space: the limited growth optimistic optimization algorithm;incremental control dependency frontier exploration for many-criteria test case generation;single-objective versus multi-objectivized optimization for evolutionary crash reproduction;a new approach for search space reduction and seeding by analysis of the clauses;evolving living technologies—Insights from the evoevo project;Learning fault localisation for both humans and machines using multi-objective GP;mapping class dependencies for fun and profit;evolving better software parameters;On the placebo effect in interactive SBSE: A preliminary study;evoIsolator: Evolving program slices for hardware isolation based security;detecting real faults in the gson library through search-based unit test generation;ultra-large repair search space with automatically mined templates: the cardumen mode of astor;how can metaheuristics help software engineers?;a tutorial on using and extending the evosuite search-based test generator;A preliminary systematic mapping study of human competitiveness of SBSE;search-based stress testing the elastic resource provisioning for cloud-based applications;injecting social diversity in multi-objective genetic programming: the case of model well-formedness rule learning;automated optimization of weighted non-functional objectives in self-adaptive systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QuickSpec: A Lightweight theory Exploration Tool for Programmers 10

QuickSpec: A Lightweight Theory Exploration Tool for Program...

引用

10th ACM SIGPLAN symposium on Haskell (Haskell) co-located with ICFP Conference

作者： Algehed, Maximilian CLaessen, Koen Johansson, Moa Smallbone, Nick Chalmers Univ Technol Gothenburg Sweden

this document gives the outline of a system demonstration for the QuickSpec theory exploration tool.

ISBN: (纸本)9781450351829

this document gives the outline of a system demonstration for the QuickSpec theory exploration tool.

关键词： functional programming theory Exploration QuickSpec

来源：评论

学校读者我要写书评

暂无评论

the Linearity Monad 10

The Linearity Monad

引用

10th ACM SIGPLAN symposium on Haskell (Haskell) co-located with ICFP Conference

作者： Paykin, Jennifer Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450351829

We introduce a technique for programming with domain-specific linear languages using the monad that arises from the theory of linear/non-linear logic. In this work we interpret the linear/nonlinear model as a simple, effectful linear language embedded inside an existing non-linear host language. We implement a modular framework for defining these linear EDSLs in Haskell, allowing both shallow and deep embeddings. To demonstrate the effectiveness of the framework and the linearity monad, we implement languages for file handles, mutable arrays, session types, and quantum computing.

关键词： linear/non-linear logic monads Haskell

来源：评论

学校读者我要写书评

暂无评论

Back to the Future: Time Travel in FRP 10

Back to the Future: Time Travel in FRP

引用

10th ACM SIGPLAN symposium on Haskell (Haskell) co-located with ICFP Conference

作者： Perez, Ivan Univ Nottingham Sch Comp Sci Nottingham England

ISBN: (纸本)9781450351829

functional Reactive programming (FRP) allows interactive applications to be modelled in a declarative manner using time-varying values. For practical reasons, however, operational constraints are often imposed, such as having a fixed time domain, time always flowing forward, and limiting the exploration of the past. In this paper we show how these constraints can be overcome, giving local control over the time domain, the direction of time and the sampling step. We study the behaviour of FRP expressions when time flows backwards, and demonstrate how to synchronize subsystems running asynchronously and at different sampling rates. We have verified the practicality of our approach with two non-trivial games in which time control is central to the gameplay.

关键词： functional reactive programming game programming time stream programming monadic streams Haskell

来源：评论

学校读者我要写书评

暂无评论

Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem

Machine Learning and Monte Carlo Sampling for the Probabilis...

引用

international symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Roberto Montemanni Federico D'ignazio Xiaochen Chou Luca Maria Gambardella Dalle Molle Institute for Artificial Intelligence (IDSIA-USI/SUPSI) Manno Canton Ticino Switzerland

ISBN: (纸本)9781538626344;9781538626337

the Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or goods to customers. Only a subset of the customer can be served in the given time, so the problem consists in the selection of the customers providing more revenues and in the optimization of a truck tour to serve them. the presence of the customers is however stochastic, and this has to be taken into account while evaluating the objective function of each solution. Due to the high computational complexity of such an objective function, Monte Carlo sampling method is used to estimate it in a fast way. there is one crucial parameter in a Monte Carlo sampling evaluator which is the number of samples to be used. More samples mean high precision, less samples mean high speed. An instance-dependent trade-off has to be found. the topic of this paper is a Machine Learning-based method to estimate the best number of samples, given the characteristics of an instance. Two methods are presented and compared from an experimental point of view. In particular, it is shown that a less intuitive and slightly more complex method is able to provide more precise estimations.

关键词： Monte Carlo methods Linear programming Probabilistic logic Biological neural networks Machine learning Optimization Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

the Complexity of Inferences and Explanations in Probabilistic logic programming 14th

The Complexity of Inferences and Explanations in Probabilist...

引用

14th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU) / 10th international symposium on Imprecise Probability - theories and Applications (ISIPTA)

作者： Cozman, Fabio G. Maua, Denis D. Univ Sao Paulo Escola Politecn Sao Paulo Brazil Univ Sao Paulo Inst Matemat & Estat Sao Paulo Brazil

ISBN: (纸本)9783319615813;9783319615806

A popular family of probabilistic logic programming languages combines logic programs with independent probabilistic facts. We study the complexity of marginal inference, most probable explanations, and maximum a posteriori calculations for propositional/relational probabilistic logic programs that are acyclic/definite/stratified/normal/disjunctive. We show that complexity classes Sigma(k) and PP Sigma k (for various values of k) and NPPP are all reached by such computations.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：