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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,054 篇 会议
51 册 图书
42 篇 期刊文献

馆藏范围

2,147 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,271 篇 工学
- 1,024 篇 计算机科学与技术...
- 582 篇 软件工程
- 253 篇 电气工程
- 157 篇 控制科学与工程
- 69 篇 信息与通信工程
- 50 篇 机械工程
- 42 篇 材料科学与工程（可...
- 36 篇 电子科学与技术（可...
- 17 篇 安全科学与工程
- 15 篇 交通运输工程
- 12 篇 土木工程
- 12 篇 化学工程与技术
- 12 篇 生物医学工程（可授...
- 12 篇 生物工程
- 11 篇 仪器科学与技术
- 11 篇 冶金工程
- 11 篇 动力工程及工程热...
- 10 篇 建筑学
295 篇 理学
- 227 篇 数学
- 39 篇 统计学（可授理学、...
- 38 篇 物理学
- 34 篇 系统科学
- 22 篇 生物学
- 16 篇 化学
118 篇 管理学
- 83 篇 管理科学与工程(可...
- 37 篇 工商管理
- 32 篇 图书情报与档案管...
47 篇 教育学
- 46 篇 教育学
24 篇 医学
- 23 篇 临床医学
10 篇 法学
- 10 篇 社会学
9 篇 经济学
5 篇 农学
4 篇 文学

主题

171 篇 logic gates
137 篇 fuzzy logic
129 篇 programming
118 篇 linear programmi...
94 篇 logic programmin...
65 篇 probabilistic lo...
59 篇 dynamic programm...
57 篇 optimization
52 篇 semantics
50 篇 training
49 篇 computer science
48 篇 logic
44 篇 object oriented ...
42 篇 computer archite...
41 篇 computational mo...
38 篇 hardware
38 篇 artificial intel...
37 篇 java
35 篇 computer program...
35 篇 software

机构

6 篇 laboratory of co...
5 篇 stevens inst tec...
5 篇 institute of log...
5 篇 university of to...
5 篇 institute for lo...
5 篇 chinese univ hon...
4 篇 univ oxford oxfo...
4 篇 school of electr...
4 篇 ibm corp thomas ...
3 篇 north carolina s...
3 篇 creighton univ o...
3 篇 univ politecn ca...
3 篇 ecole polytech f...
3 篇 tu wien austria
3 篇 department of co...
3 篇 department of el...
3 篇 rhein westfal th...
3 篇 school of comput...
3 篇 univ tokyo
3 篇 school of mathem...

作者

7 篇 inoue katsumi
5 篇 sakama chiaki
5 篇 gupta gopal
4 篇 wang liang
4 篇 iosif radu
4 篇 pontelli enrico
4 篇 liang wang
4 篇 tompits hans
4 篇 beck j. christop...
3 篇 kumar amruth n.
3 篇 chopra amit k.
3 篇 proietti maurizi...
3 篇 il han park
3 篇 m.-r. akbarzadeh...
3 篇 wei li
3 篇 riguzzi fabrizio
3 篇 schaub torsten
3 篇 melin p
3 篇 leonidas deligia...
3 篇 mcdirmid sean

语言

2,076 篇 英文
59 篇 其他
20 篇 中文
1 篇 西班牙文
1 篇 法文

检索条件"任意字段=22nd International Conference on Logic Programming"

共 2147 条记录，以下是1451-1460 订阅

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

详细简洁

排序：

On Learning Constraint Problems

On Learning Constraint Problems

引用

22nd international conference on Tools with Artificial Intelligence

作者： Lallouet, Arnaud Lopez, Matthieu Martin, Lionel Vrain, Christel Univ Caen GREYC F-14032 Caen France Univ Orleans LIFO F-45067 Orleans France

ISBN: (纸本)9780769542638

It is well known that modeling with constraints networks require a fair expertise. Thus tools able to automatically generate such networks have gained a major interest. The major contribution of this paper is to set a new framework based on Inductive logic programming able to build a constraint model from solutions and non-solutions of related problems. The model is expressed in a middle-level modeling language. On this particular relational learning problem, traditional top-down search methods fall into blind search and bottom-up search methods produce too expensive coverage tests. Recent works in Inductive logic programming about phase transition and crossing plateau shows that no general solution can face all these difficulties. In this context, we have designed an algorithm combining the major qualities of these two types of search techniques. We present experimental results on some benchmarks ranging from puzzles to scheduling problems.

关键词： Constraint modeling automatic acquisition inductive logic programming relational learning

来源：评论

学校读者我要写书评

暂无评论

Mode-Directed Tabling for Dynamic programming, Machine Learning, and Constraint Solving

Mode-Directed Tabling for Dynamic Programming, Machine Learn...

引用

22nd international conference on Tools with Artificial Intelligence

作者： Zhou, Neng-Fa Kameya, Yoshitaka Sato, Taisuke CUNY Brooklyn Coll Dept Comp & Informat Sci Brooklyn NY 11210 USA Grad Ctr Brooklyn NY 11210 USA Tokyo Inst Technol Grad Sch Informat Sci & Engn Meguro Japan

ISBN: (纸本)9780769542638

Mode-directed tabling amounts to using table modes to control what arguments are used in variant checking of subgoals and how answers are tabled. A mode can be min, max, + (input), - (output), or nt (non-tabled). While the traditional table-all approach to tabling is good for finding all answers, mode-directed tabling is well suited to dynamic programming problems that require selective answers. In this paper, we present three application examples of mode-directed tabling, namely, (1) hydraulic system planning, a dynamic programming problem, (2) the Viterbi algorithm in PRISM, a probabilistic logic reasoning and learning system, and (3) constraint checking in evaluating Answer Set Programs (ASP). For the Viterbi application, the feature of enabling a cardinality limit in a table mode declaration plays an important role. For a PRISM program and a set of data, the explanations may be too large to be completely stored and the cardinality limit allows for Viterbi inference based on a subset of explanations. The mode nt, which specifies an argument that can participate in the computation of a tabled predicate but is never tabled either in subgoal or answer tabling, is useful in constraint checking for the Hamilton cycle problem encoded as an ASP. These examples demonstrate the usefulness of mode-directed tabling.

关键词： Hamilton cycle Viterbi algorithm answer set program constraint solving dynamic programming dynamic programming hydraulic system planning learning (artificial intelligence) machine learning mode directed tabling probabilistic logic reasoning

来源：评论

学校读者我要写书评

暂无评论

A parallel solving algorithm for quantified constraints problems

A parallel solving algorithm for quantified constraints prob...

引用

22nd international conference on Tools with Artificial Intelligence

作者： Vautard, Jeremie Lallouet, Arnaud Hamadi, Youssef Univ Caen GREYC BP 5186 F-14032 Caen France Microsoft Res Cambridge England

ISBN: (纸本)9780769542638

Quantified constraint satisfaction problems have been the topic of an increasing number of studies for a few years. However, only sequential resolution algorithms have been proposed so far. This paper presents a parallel QCSP(+) solving algorithm based on a problem-partition approach. It then discuss about work distribution policies and presents several experimental results comparing several parameters.

关键词： Constraint programming Quantification

来源：评论

学校读者我要写书评

暂无评论

Absurdity, Contradictions, and logical Formalisms

Absurdity, Contradictions, and Logical Formalisms

引用

22nd international conference on Tools with Artificial Intelligence

作者： Besnard, Philippe Univ Toulouse 3 IRIT CNRS F-31062 Toulouse France

ISBN: (纸本)9780769542638

In this paper, we examine logical formalisms with respect to contradictions and related notions. We deal with virtually any kind of logical formalisms, including those that fail to have any connective. We investigate various properties, especially paraconsistency. Among the topics discussed are ways of specifying contradictions and, more generally, inconsistency, as well as a few criteria for paraconsistency. We further explore logical formalisms that overlap with fragments of classical logic, and provide a couple of formal results for them. A number of options about inconsistency are also discussed throughout the text, insisting on how contradictions can be specified either directly, or by way of reference to a fragment of classical logic. Importantly, the concept of undesirable conclusions is given a formal account, which is applied to most of the issues involved in this paper. A noticeable point is that we take into account not only features of the language, depending on the formalism, but also some aspects of inference, most notably the so-called Identity.

关键词： logical Absurdity Inconsistency formalism Spouses Formal logic Language Fragments

来源：评论

学校读者我要写书评

暂无评论

Conflicts Handling in Cooperative Intrusion Detection : a description logic approach

Conflicts Handling in Cooperative Intrusion Detection : a de...

引用

22nd international conference on Tools with Artificial Intelligence

作者： Yahi, Safa Benferhat, Salem Kenaza, Tayeb Univ Lille Nord France F-62307 Artois Lens France CNRS UMR 8188 F-62307 Lens France

ISBN: (纸本)9780769542638

In cooperative intrusion detection, several intrusion detection systems (IDS), network analyzers, vulnerability analyzers and other analyzers are deployed in order to get an overview of the system under consideration. In this case, the definition of a shared vocabulary describing the different information is prominent. Since these pieces of information are structured, we first propose to use description logics which ensure the reasoning decidability. Besides, the analyzers used in cooperative intrusion detection are not totally reliable. The second contribution of this paper is to handle these inconsistencies induced by the use of several analyzers using the so-called partial lexicographic inference.

关键词： Description logics IDS conflicts conflicts handling cooperative intrusion detection cooperative systems intrusion detection intrusion detection system network analysers network analyzer partial lexicographic inference security of data vulnerability analyzer

来源：评论

学校读者我要写书评

暂无评论

Combining Mixed Integer programming and Supervised Learning for Fast Re-planning

Combining Mixed Integer Programming and Supervised Learning ...

引用

22nd international conference on Tools with Artificial Intelligence

作者： Rachelson, Emmanuel Ben Abbes, Ala Diemer, Sebastien Univ Liege Dept EECS B-4000 Liege Belgium EDF R&D Optimisat Simulat Risques & Stat F-92141 Clamart France

ISBN: (纸本)9780769542638

We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the use of Supervised Learning method for the offline construction of a predictor which takes the problem's parameters as input and infers values for the discrete optimization variables. This way, the online resolution time of the plan repair problem can be greatly decreased by avoiding a large part of the combinatorial search among discrete variables. This contribution was motivated by the large-scale problem of intra-daily recourse strategy computation in electrical power systems. We report and discuss results on this benchmark, illustrating the different aspects and mechanisms of this new approach which provided close-to-optimal solutions in only a fraction of the computational time necessary for existing solvers.

关键词： Mixed Integer programming Boosting Power Systems Planning Hybrid methods

来源：评论

学校读者我要写书评

暂无评论

Robust Value-at-Risk Optimization with Interval Random Uncertainty Set

Robust Value-at-Risk Optimization with Interval Random Uncer...

引用

22nd international conference on Tools with Artificial Intelligence

作者： Chen, Wei Tan, Shaohua Peking Univ Sch EECS Minist Educ Key Lab High Confidence Software Technol Beijing 100871 Peoples R China Peking Univ Key Lab Machine Percept Beijing 100871 Peoples R China

ISBN: (纸本)9780769542638

This paper addresses a new uncertainty set-interval random uncertainty set for robust Value-at-Risk optimization. The form of interval random uncertainty set makes it suitable for capturing the downside and upside deviations of real-world data. These deviation measures capture distributional asymmetry and lead to better optimization results. We also apply our interval random chance-constrained programming to robust Value-at-Risk optimization under interval random uncertainty sets in the elements of mean vector. Numerical experiments with real market data indicate that our approach results in better portfolio performance.

关键词： Value-at-risk interval random uncertainty set interval random chance-constrained programming

来源：评论

学校读者我要写书评

暂无评论

logic Characteristics of 40 nm thin-channel InAs HEMTs

Logic Characteristics of 40 nm thin-channel InAs HEMTs

引用

22nd international conference on Indium Phosphide and Related Materials

作者： Kim, Tae-Woo Kim, Dae-Hyun del Alamo, Jesus A. MIT Microsyst Technol Labs Cambridge MA 02139 USA Teledyne Sci Co Thousand Oaks CA USA

ISBN: (纸本)9781424459209

We have experimentally investigated the trade-offs involved in thinning down the channel of III-V FETs with the ultimate goal of enhancing the electrostatic integrity and scalability of these devices. To do so, we have fabricated InAs HEMTs with a channel thickness of t(ch) = 5 nm and we have compared them against, InAs HEMTs with t(ch) = 10 nm. The fabricated thin-channel devices exhibit outstanding logic performance and scalability down to 40 nm in gate length. L-g = 40 nm devices exhibit S = 72 mV/dec, DIBL = 72 mV/V, and I-ON/I-OFF = 2.5 x 10(4), all at V-DS = 0.5 V. However, there are trade-offs of using a thin channel which manifest themselves in a higher source resistance, lower transconductance, and lower f(T) when compared with InAs HEMTs with t(ch) = 10 nm.

关键词： Indium arsenide

来源：评论

学校读者我要写书评

暂无评论

The Ordered Distribute Constraint

The Ordered Distribute Constraint

引用

22nd international conference on Tools with Artificial Intelligence

作者： Petit, Thierry Regin, Jean-Charles Mines Nantes LINA CNRS UMR 6241 F-44307 Nantes France Univ Nice Sophia Antipolis Sophia Antipolis France

ISBN: (纸本)9780769542638

In this paper we introduce a new cardinality constraint: ORDEREDDISTRIBUTE. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not consider at the same time the occurrences of all the values greater than v. We design an algorithm for achieving generalized arc-consistency on ORDEREDDISTRIBUTE, with a time complexity linear in the sum of the number of variables and the number of values in the union of their domains. In addition, we give some experiments showing the advantage of this new constraint for problems where values represent levels whose overrunning has to be under control.

关键词： Constraint programming Global Constraints Optimization

来源：评论

学校读者我要写书评

暂无评论

MOS Current Mode logic Realization of Digital Arithmetic circuits

MOS Current Mode Logic Realization of Digital Arithmetic cir...

引用

22nd international conference on Microelectronics (ICM 2010)

作者： El-Hariry, Yassmeen M. Madian, Ahmed H. GUC Elect & Elect Engn Dept New Cairo Egypt Egyptian Atom Energy Author NCRRT Engn Dept Cairo Egypt

ISBN: (纸本)9781612841519

In this paper, MOS current mode logic (MCML) and dynamic current mode logic (DyCML) techniques are analyzed and applied to the generation of digital arithmetic circuits. A full adder structure is demonstrated, analyzed and compared with equivalent CMOS, Domino and CPL structures and realized using 0.18 mu m CMOS technology operating with 1.5V and -1.5V supply voltages. Also, a four bit multiplier and a CORDIC block were analyzed and realized using MOS Current Mode logic. PSPICE simulation results of each realization have been demonstrated.

关键词： CORDIC Current mode logic four-bit Multiplier low power dissipation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共215页 << < 142 143 144 145 146 147 148 149 150 151 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：