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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,022 篇 期刊文献
820 篇 会议
22 篇 学位论文

馆藏范围

1,864 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,605 篇 工学
- 1,333 篇 计算机科学与技术...
- 494 篇 软件工程
- 177 篇 电气工程
- 135 篇 控制科学与工程
- 134 篇 机械工程
- 55 篇 信息与通信工程
- 51 篇 土木工程
- 40 篇 交通运输工程
- 37 篇 建筑学
- 15 篇 化学工程与技术
- 15 篇 石油与天然气工程
- 15 篇 航空宇航科学与技...
- 14 篇 材料科学与工程（可...
- 11 篇 力学（可授工学、理...
- 11 篇 电子科学与技术（可...
- 11 篇 生物工程
- 10 篇 仪器科学与技术
- 9 篇 动力工程及工程热...
618 篇 管理学
- 599 篇 管理科学与工程(可...
- 119 篇 工商管理
- 12 篇 图书情报与档案管...
485 篇 理学
- 362 篇 数学
- 166 篇 系统科学
- 31 篇 生物学
- 17 篇 物理学
- 6 篇 统计学（可授理学、...
78 篇 经济学
- 65 篇 应用经济学
- 14 篇 理论经济学
15 篇 医学
- 8 篇 基础医学(可授医学...
8 篇 法学
8 篇 教育学
- 6 篇 教育学
8 篇 农学
4 篇 艺术学
2 篇 文学
1 篇 哲学
1 篇 历史学

主题

1,864 篇 constraint progr...
174 篇 scheduling
84 篇 optimization
65 篇 integer programm...
42 篇 combinatorial op...
39 篇 mixed integer pr...
35 篇 local search
35 篇 integer linear p...
29 篇 constraint satis...
28 篇 mathematical pro...
28 篇 machine learning
25 篇 mixed integer li...
23 篇 linear programmi...
23 篇 column generatio...
22 篇 large neighborho...
22 篇 mixed-integer pr...
22 篇 planning
22 篇 global constrain...
22 篇 constraint propa...
20 篇 search

机构

24 篇 pontificia univ ...
13 篇 univ autonoma ch...
13 篇 univ st andrews ...
12 篇 univ toronto dep...
11 篇 univ san sebasti...
10 篇 univ cient sur l...
9 篇 univ bologna dei...
9 篇 brown univ provi...
8 篇 univ tehran coll...
8 篇 univ cent chile ...
7 篇 carnegie mellon ...
7 篇 univ playa ancha...
7 篇 natl univ irelan...
7 篇 univ valparaiso ...
7 篇 new mexico state...
6 篇 katholieke univ ...
6 篇 natl yunlin univ...
6 篇 univ nantes lina...
6 篇 natl univ irelan...
6 篇 hacettepe univ d...

作者

30 篇 crawford broderi...
28 篇 beck j. christop...
26 篇 stuckey peter j.
24 篇 monfroy eric
23 篇 soto ricardo
23 篇 schaus pierre
21 篇 rousseau louis-m...
20 篇 milano michela
18 篇 van hentenryck p...
17 篇 lombardi michele
17 篇 o'sullivan barry
16 篇 miguel ian
14 篇 wallace mark
14 篇 hofstedt petra
14 篇 guns tias
13 篇 castro carlos
13 篇 loudni samir
12 篇 boizumault patri...
12 篇 nightingale pete...
12 篇 nijssen siegfrie...

语言

1,741 篇 英文
94 篇 其他
11 篇 中文
6 篇 法文
2 篇 土耳其文
1 篇 德文
1 篇 西班牙文
1 篇 葡萄牙文

检索条件"主题词=Constraint Programming"

共 1864 条记录，以下是1131-1140 订阅

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

详细简洁

排序：

A Choice Functions Portfolio for Solving constraint Satisfaction Problems: A Performance Evaluation 34

A Choice Functions Portfolio for Solving Constraint Satisfac...

引用

2015 34th International Conference of the Chilean Computer Science Society (SCCC)

作者： Soto, Ricardo Crawford, Broderick Olivares, Rodrigo Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Autonoma Chile Santiago Chile Univ Cient Sur Lima Peru Univ Cent Chile Santiago Chile Univ San Sebastian Santiago Chile Univ Valparaiso Valparaiso Chile

ISBN: (纸本)9781467398176

constraint programming (CP) allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem, phase known as enumeration. In this context, Autonomous Search (AS) that is a particular case of adaptive systems, enables the problem solver to control and adapt its internal configuration during solving time, based on performance metrics in order to be more efficient. The goal is to provide a mechanism for CP solvers, integrating a component able to evaluate the solving performance process. In particular, we employ a classic decision making method called Choice Function (CF). In this paper, we present an evaluation of different choice functions, based on performance exhibited in a indicators set. The results are promising and show that it is feasible to solve constraint satisfaction problems with this new technique.

关键词： constraint programming autonomous search choice function

来源：评论

学校读者我要写书评

暂无评论

Enumeration Strategies for Solving constraint Satisfaction Problems: A Performance Evaluation 4th

Enumeration Strategies for Solving Constraint Satisfaction P...

引用

4th Computer Science On-line Conference (CSOC)

作者： Soto, Ricardo Crawford, Broderick Olivares, Rodrigo Herrera, Rodrigo Johnson, Franklin Paredes, Fernando Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Autonoma Chile Santiago Chile Univ Cent Chile Santiago Chile Univ Finis Terrae Santiago Chile Univ San Sebastian Santiago Chile Univ Valparaiso Valparaiso Chile Univ Playa Ancha Valparaiso Chile Univ Diego Portales Escuela Ingn Ind Valparaiso Chile

ISBN: (纸本)9783319184760;9783319184753

constraint programming allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem. The enumeration strategy is responsible for selecting the order in which those variables and values are selected to produce a potential solution. There exist different ways to perform this selection, and depending on the quality of this decision, the efficiency of the solving process may dramatically vary. A main concern in this context is that the behavior of the strategy is notably hard to predict. In this paper, we present a performance evaluation of 24 enumeration strategies for solving constraint satisfaction problems. Our goal is to provide new and interesting knowledge about the behavior of such strategies. To this end, we employ a set of wellknown benchmarks that collect general features that may be present on most constraint satisfaction and optimization problems. We believe this information will be useful to help users making better solving decisions when facing new problems.

关键词： constraint programming constraint satisfaction problems enumeration strategies heuristics

来源：评论

学校读者我要写书评

暂无评论

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network 28

Allocation of Parallel Real-Time Tasks in Distributed Multi-...

引用

28th International Conference on Architecture of Computing Systems (ARCS)

作者： Garibay-Martinez, Ricardo Nelissen, Geoffrey Ferreira, Luis Lino Pinho, Luis Miguel ISEP IPP CISTER INESC TEC Res Ctr P-4200072 Oporto Portugal

ISBN: (纸本)9783319160863;9783319160856

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

关键词： constraint programming Real-time Parallel tasks Distributed multi-core architectures

来源：评论

学校读者我要写书评

暂无评论

Rectangle Placement for VLSI Testing 1

引用

12th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in constraint programming (CPAIOR)

作者： Aharoni, Merav Boni, Odellia Freund, Ari Goren, Lidor Ibraheem, Wesam Segev, Tamir IBM Res Haifa Israel IBM STG Fishkill New York NY USA

ISBN: (数字)9783319180083

ISBN: (纸本)9783319180083;9783319180076

We report our solution to the problem of designing test-site chips. This is a specific variation of the VLSI floorplanning problem where rectangular macros must be placed without overlap in a given area, but no wiring between the macros exists. Typically, industrial problems of this type require placing hundreds of macros of different sizes and shapes and include additional constraints such as fixing or grouping some of the macros. Many tools and techniques developed to solve similar problems proved unsuitable for this specific variation. We used constraint programming (CP) with additional heuristics, including sophisticated variable and value orderings, to produce floorplans for real test-sites. Our CP solution is successfully used in production by test-site designers.

关键词： Floorplanning Electronic design automation constraint programming Non overlapping rectangles placement

来源：评论

学校读者我要写书评

暂无评论

Probabilistic constraints for Robot Localization 17th

Probabilistic Constraints for Robot Localization

引用

17th Portuguese Conference on Artificial Intelligence (EPIA)

作者： Correia, Marco Meshcheryakova, Olga Sousa, Pedro Cruz, Jorge UNL FCT DI NOVA Lab Comp Sci & Informat Caparica Portugal

ISBN: (纸本)9783319234854;9783319234847

In robot localization problems, uncertainty arises from many factors and must be considered together with the model constraints. Probabilistic robotics is the classical approach for dealing with hard robotic problems that relies on probability theory. This work describes the application of probabilistic constraint techniques in the context of probabilistic robotics to solve robot localization problems. Instead of providing the most probable position of the robot, the approach characterizes all positions consistent with the model and their probabilities (in accordance with the underlying uncertainty). It relies on constraint programming to get a tight covering of the consistent regions combined with Monte Carlo integration techniques that benefit from such reduction of the sampling space.

关键词： Probabilistic robotic constraint programming Robot localization

来源：评论

学校读者我要写书评

暂无评论

Towards More Relational Feature Models 10

Towards More Relational Feature Models

引用

10th International Conference on Software Technologies (ICSOFT)

作者： Gotlieb, Arnaud Marijan, Dusica Sen, Sagar Simula Res Lab Certus Software V&V Ctr Lysaker Norway

ISBN: (纸本)9789897581397

Feature modeling is of paramount importance to capture variabilities and commonalities within a software product line. Nevertheless, current feature modeling notations are limited, representing only propositional formulae over attributed variables. This position paper advocates the extension of feature modeling formalisms with richer computational domains and relational operations. In particular, it proposes to extend feature modeling with finite and continuous domain variables, with first-order logic quantifiers (for all,there exists), and with N-ary relations between features attributes, and with so-called global constraints. In order to extend the expressiveness while preserving automated analysis facilities, feature models could be semantically interpreted as first-order logic formulae (instead of propositional logic formulae), including global and continuous dependency between features. In simpler words, this paper emphasizes the importance of having more relational feature models and presents next-generation applications.

关键词： Feature Modeling Variability constraint programming

来源：评论

学校读者我要写书评

暂无评论

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining 6th

引用

6th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K)

作者： Benhamou, Belaid Jabbour, Said Sais, Lakhdar Salhi, Yacoub Aix Marseille Univ LSIS Domaine Univ St JeromeAve Escadrille Normandie F-13397 Marseille 20 France Univ Artois CRIL F-62307 Lens France

ISBN: (纸本)9783319258409;9783319258393

The search of frequent patterns in a transaction database is a well-known problem in the field of data mining. Several specific methods for solving this problem and its variants have been developed in the data mining community. A generic and declarative alternative approach to these targeted and specific methods was recently introduced. It consists in representing the data mining problems as constraint networks, then use an appropriate solver as a black box to solve the encoded problem. For instance, several works expressed the frequent itemset mining problem and its variants as constraint networks or Boolean satisfiability, and thus offer the possibility of using the associated efficient solvers to solve the problem. On the other hand, the symmetry notion was very invested and shown to be efficient in the fields of constraint programming and propositional satisfiability. The principle of symmetry could be exported to other areas where some structures can be exploited effectively. Especially, in the field of data mining where several tasks can be expressed as constraint networks. In this work, we propose a generic and declarative method to eliminate symmetries in data mining problems expressed as Boolean constraints. We show how the symmetries between items of a transaction database can be detected and eliminated by adding symmetries breaking predicates (SBP) to the Boolean encoding of the considered data mining problem.

关键词： Data mining Itemset mining Symmetry Satisfiability constraint programming

来源：评论

学校读者我要写书评

暂无评论

Model-Based Problem Solving for University Timetable Validation and Improvement 20

引用

20th International Symposium on Formal Methods (FM)

作者： Schneider, David Leuschel, Michael Witt, Tobias Univ Dusseldorf Inst Informat Dusseldorf Germany

ISBN: (纸本)9783319192499;9783319192482

constraint satisfaction problems can be expressed very elegantly in state-based formal methods such as B. However, can such specifications be directly used for solving real-life problems? We will try and answer this question in the present paper with regard to the university timetabling problem. We report on an ongoing project to build a formal model-based curriculum timetable validation tool where we use a formal specification as the basis to validate timetables from a student's perspective and to support incremental modification of timetables. In this article we focus on expressing the problem domain, the formalization in B and our approach to execute the formal model in a production system using ProB.

关键词： B-method constraint programming Timetabling Scheduling

来源：评论

学校读者我要写书评

暂无评论

A Filtering Technique for Helping to Solve Sudoku Problems 17th

A Filtering Technique for Helping to Solve Sudoku Problems

引用

2nd International Conference on Learning and Collaboration Technologies / 17th International Conference on Human-Computer Interaction

作者： Soto, Ricardo Crawford, Broderick Galleguillos, Cristian Crawford, Kathleen Paredes, Fernando Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Autonoma Chile Santiago Chile Univ Cient Sur Lima Peru Univ Cent Chile Santiago Chile Univ San Sebastian Santiago Chile Univ Diego Portales Escuela Ingn Ind Santiago Chile

ISBN: (纸本)9783319213804;9783319213798

This paper highlights the current usability issues when solving Sudoku problems. This problem is a well-known puzzle game which consists in assigning numbers in a game board, commonly of 9 x 9 size. The board of the game is composed of 9 columns, 9 rows and 9 3 x 3 sub-grids;each one containing 9 cells with distinct integers from 1 to 9. A game is completed when all cells have a value assigned, and the previous constraints are satisfied. Some instances are very difficult to solve, to tackle this issue, we have used a filtering technique named Arc Consistency 3 (AC3) from the constraint programming domain. This algorithm has revealed which is much related to the strategies employed by users in order to solve the Sudoku instances, but in contrast, this technique is executed in a short time, offering a good resolution guide to the users. In general, filtering techniques make easier solving Sudoku puzzles, providing good information to users for this.

关键词： Sudoku constraint programming Arc consistency

来源：评论

学校读者我要写书评

暂无评论

Approximate Counting with Deterministic Guarantees for Affinity Computation 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO)

作者： Viricel, Clement Simoncini, David Allouche, David de Givry, Simon Barbe, Sophie Schiex, Thomas INRA Unite Math & Informat Appl UR 875 F-31320 Castanet Tolosan France CNRS 5504 INSA UMR INRA 792 Lab Ingn Syst Biol & Proc F-31400 Toulouse France

ISBN: (纸本)9783319181677;9783319181660

Computational Protein Design aims at rationally designing amino-acid sequences that fold into a given three-dimensional structure and that will bestow the designed protein with desirable properties/functions. Usual criteria for design include stability of the designed protein and affinity between it and a ligand of interest. However, estimating the affinity between two molecules requires to compute the partition function, a #P-complete problem. Because of its extreme computational cost, bio-physicists have designed the K* algorithm, which combines Best-First A* search with dominance analysis to provide an estimate of the partition function with deterministic guarantees of quality. In this paper, we show that it is possible to speed up search and keep reasonable memory requirement using a Cost Function Network approach combining Depth First Search with arc consistency based lower bounds. We describe our algorithm and compare our first results to the CPD-dedicated software Osprey 2.0.

关键词： computational protein design protein-ligand affinity constraint programming cost function network soft arc consistency counting problems weighted #CSP

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共187页 << < 110 111 112 113 114 115 116 117 118 119 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：