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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,005 篇 会议
51 篇 期刊文献
20 册 图书

馆藏范围

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

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

197 篇 constraint theor...
162 篇 constraint satis...
64 篇 constraint progr...
26 篇 constrained opti...
26 篇 logic programmin...
24 篇 computer program...
24 篇 answer set progr...
21 篇 integer programm...
18 篇 scheduling
15 篇 artificial intel...
15 篇 dynamic programm...
14 篇 mathematical log...
13 篇 problem solving
12 篇 linear programmi...
12 篇 programming lang...
10 篇 global constrain...
10 篇 logics and meani...
9 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

19 篇 natl univ irelan...
18 篇 brown univ provi...
14 篇 univ connecticut...
14 篇 cork constraint ...
10 篇 cork constraint ...
8 篇 univ oxford comp...
7 篇 natl univ irelan...
7 篇 natl univ irelan...
7 篇 department of me...
6 篇 nicta nsw
6 篇 161 rue ada mont...
6 篇 natl univ singap...
6 篇 univ st andrews ...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 ben gurion univ ...
5 篇 brown univ dept ...
5 篇 department of co...

作者

29 篇 stuckey peter j.
29 篇 o'sullivan barry
22 篇 van hentenryck p...
19 篇 freuder eugene c...
18 篇 walsh toby
17 篇 quimper claude-g...
16 篇 miguel ian
16 篇 michel laurent
15 篇 smith barbara m.
14 篇 régin jean-charl...
14 篇 bessiere christi...
14 篇 schaus pierre
13 篇 gent ian p.
13 篇 beldiceanu nicol...
13 篇 schulte christia...
13 篇 pesant gilles
12 篇 beck j. christop...
11 篇 hebrard emmanuel
10 篇 hnich brahim
10 篇 nightingale pete...

语言

1,073 篇 英文
3 篇 中文

检索条件"任意字段=9th International Conference on Principles and Practice of Constraint Programming"

共 1076 条记录，以下是811-820 订阅

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

详细简洁

排序：

Using integer linear programming methods for optimizing the real-time pump scheduling 9

Using integer linear programming methods for optimizing the ...

引用

9th international conference on the practice and theory of Automated Timetabling, PATAT 2012

作者： de la Perriere, Louise Brac Jouglet, Antoine Nace, Alexandre Nace, Dritan Laboratoire Heudiasyc UMR CNRS 7253 Universite de Technologie de Compiegne Centre de Recherches de Royallieu BP 20529 COMPIEGNE Cedex60205 France Lyonnaise des Eaux Ondeo Systems 38 rue du president Wilson Le Pecq78230 France

ISBN: (纸本)9788214052985

the work presented in this talk deals with the management of a drinking water distribution network in terms of planning the use of different installations (treatment works, pumping stations, and valves) in order to convey water from sources (rivers, borings, springs,...) to supply areas. More precisely we study the real-time pump scheduling problem. Being given a water distribution network and some previsions on the consumption at different nodes of the network during a considered time horizon, the main problem is to schedule water pump jobs under the constraint to satisfy water demands with the quality standards settled by French and European legislation, while minimizing the operating costs (treatment and electricity). these operations should satisfy technical constraints as the respect of the minimum and maximum level of tanks, some contractual constraints as the respect of power levels defined by electricity supplier contracts, and last take some specific water distribution network constraints related to the impact of pressure in modeling or the need of the raw water flow to be as smooth as possible. the task is difficult because of the number and variety of operational constraints that exist in a water distribution system. Recently, this problem becomes more relevant because of the future liberalisation of the electric market that will make difficult the knowledge of the less expensive time slots. In this talk we will provide a study on the different constraints needed to be modelized and mathematical models for each of them. One of the main problems encountered in modelling is how to deal with hydraulic constraints in our network. this issue is of primary importance as it will lead the choice of the resolution tool to be used. © PATAT 2012.

关键词： Operating costs

来源：评论

学校读者我要写书评

暂无评论

A job dispatcher for large and heterogeneous HPC systems running modern applications 27

A job dispatcher for large and heterogeneous HPC systems run...

引用

27th international conference on principles and practice of constraint programming, CP 2021

作者： Galleguillos, Cristian Kiziltan, Zeynep Soto, Ricardo Pontificia Universidad Católica de Valparaíso Chile University of Bologna Italy

ISBN: (纸本)9783959772112

High-performance Computing (HPC) systems have become essential instruments in our modern society. As they get closer to exascale performance, HPC systems become larger in size and more heterogeneous in their computing resources. With recent advances in AI, HPC systems are also increasingly being used for applications that employ many short jobs with strict timing requirements. HPC job dispatchers need to therefore adopt techniques to go beyond the capabilities of those developed for small or homogeneous systems, or for traditional compute-intensive applications. In this paper, we present a job dispatcher suitable for today's large and heterogeneous systems running modern applications. Unlike its predecessors, our dispatcher solves the entire dispatching problem using constraint programming (CP) with a model size independent of the system size. Experimental results based on a simulation study show that our approach can bring about significant performance gains over the existing CP-based dispatchers in a large or heterogeneous system. © Cristian Galleguillos, Zeynep Kiziltan, and Ricardo Soto.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Binary constraint Trees and Structured Decomposability 29

Binary Constraint Trees and Structured Decomposability

引用

29th international conference on principles and practice of constraint programming, CP 2023

作者： Kučera, Petr Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University Prague Czech Republic

ISBN: (纸本)9783959773003

A binary constraint tree (BCT, Wang and Yap 2022) is a normalized binary CSP whose constraint graph is a tree. A BCT constraint is a constraint represented with a BCT where some of the variables may be hidden (i.e. existentially quantified and used only for internal representation). Structured decomposable negation normal forms (SDNNF) were introduced by Pipatsrisawat and Darwiche (2008) as a restriction of decomposable negation normal forms (DNNF). Both DNNFs and SDNNFs were studied in the area of knowledge compilation. In this paper we show that the BCT constraints are polynomially equivalent to SDNNFs. In particular, a BCT constraint can be represented with an SDNNF of polynomial size and, on the other hand, a constraint that can be represented with an SDNNF, can be represented as a BCT constraint of polynomial size. this generalizes the result of Wang and Yap (2022) that shows that a multivalued decision diagram (MDD) can be represented with a BCT. Moreover, our result provides a full characterization of binary constraint trees using a language that is well studied in the area of knowledge compilation. It was shown by Wang and Yap (2023) that a CSP on n variables of domain sizes bounded by d that has treewidth k can be encoded as a BCT on O(n) variables with domain sizes O(dk+1). We provide an alternative reduction for the case of binary CSPs. this allows us to compile any binary CSP to an SDNNF of size that is parameterized by d and k. © Petr Kučera.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Feature term subsumption using constraint programming with basic variable symmetry

Feature term subsumption using constraint programming with b...

引用

18th international conference on principles and practice of constraint programming, CP 2012

作者： Ontañón, Santiago Meseguer, Pedro Computer Science Department Drexel University Philadelphia PA 19104 United States IIIA-CSIC Universitat Autònoma de Barcelona Bellaterra 08193 Spain

ISBN: (纸本)9783642335570

Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide usage is that their basic operation, subsumption, has a very high computational cost. constraint programming is a very suitable technique to implement that operation, in some cases providing orders of magnitude speed-ups with respect to the standard subsumption approach. In addition, exploiting a basic variable symmetry -that often appears in Feature Terms databases- causes substantial additional savings. We provide experimental results of the benefits of this approach. © 2012 Springer-Verlag.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Pseudo-Boolean Reasoning about States and Transitions to Certify Dynamic programming and Decision Diagram Algorithms 30

Pseudo-Boolean Reasoning about States and Transitions to Cer...

引用

30th international conference on principles and practice of constraint programming, CP 2024

作者： Demirovic, Emir McCreesh, Ciaran McIlree, Matthew J. Nordström, Jakob Oertel, Andy Sidorov, Konstantin TU Delft Netherlands University of Glasgow United Kingdom University of Copenhagen Denmark Lund University Sweden

ISBN: (纸本)9783959773362

Pseudo-Boolean proof logging has been used successfully to provide certificates of optimality from a variety of constraint- and satisifability-style solvers that combine reasoning with a backtracking or clause-learning search. Another paradigm, occurring in dynamic programming and decision diagram solving, instead reasons about partial states and possible transitions between them. We describe a framework for generating clean and efficient pseudo-Boolean proofs for these kinds of algorithm, and use it to produce certifying algorithms for knapsack, longest path, and interval scheduling. Because we use a common proof system, we can also reason about hybrid solving algorithms: we demonstrate this by providing proof logging for a dynamic programming based knapsack propagator inside a constraint programming solver. © Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, and Konstantin Sidorov.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming - CP 2009 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ian P. Gent

ISBN: (数字)9783642042447

ISBN: (纸本)9783642042430

this volume contains the papers presented at CP 2009: the 15th international conference on principles and practice of constraint programming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved with the conference thanks our sponsors for their support. there were 128 submissions to the research track, of which 53 were accepted for a rate of 41.4%. Each submission was reviewed by three reviewers, with a small number of additional reviews obtained in exceptional cases. Each review waseitherbyaProgrammeCommitteemember,orbyacolleagueinvitedtohelp by a committee member thanks to their particular expertise. Papers submitted as long papers were accepted at full length or not at all. It is important to note that papers submitted as short papers were held to the same high standards of qualityas long papers. there is thus no distinction in these proceedings between long and short papers, except of course the number of pages they occupy. As it happens, the acceptancerates of short and long papers wereverysimilar indeed. therewere13submissionstotheapplicationtrack,ofwhich8wereaccepted, fora rateof61.5%.Papersunderwentthe samereviewprocessasregularpapers, and there was not a separate committee for reviewing application track papers. However, papers in the application track were not required to be original or novel research, but to be original and novel as an application of constraints.

关键词： programming Techniques Software Engineering programming Languages, Compilers, Interpreters Computational Science and Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

Generic SBDD using computational group theory

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Gent, Ian P. Harvey, Warwick Kelsey, Tom Linton, Steve School of Computer Science University of St Andrews St Andrews FifeKY16 9SS United Kingdom IC-Parc Imperial College London Exhibition Road LondonSW7 2AZ United Kingdom

ISBN: (纸本)3540202021

We introduce a novel approach for symmetry breaking by dominance detection (SBDD). the essence of SBDD is to perform ‘dominance checks’ at each node in a search tree to ensure that no symmetrically equivalent node has been visited before. While a highly effective technique for dealing with symmetry in constraint programs, SBDD forces a major overhead on the programmer, of writing a dominance checker for each new problem to be solved. Our novelty here is an entirely generic dominance checker. this in itself is new, as are the algorithms to implement it. It can be used for any symmetry group arising in a constraint program. A constraint programmer using our system merely has to define a small number (typically 2–6) of generating symmetries, and our system detects and breaks all resulting symmetries. Our dominance checker also performs some propagation, again generically, so that values are removed from variables if setting them would lead to a successful dominance check. We have implemented this generic SBDD and report results on its use. Our implementation easily handles problems involving 1036 symmetries, with only four permutations needed to direct the dominance checks during search. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Group theory

来源：评论

学校读者我要写书评

暂无评论

Exploiting Functional constraints in Automatic Dominance Breaking for constraint Optimization 28

Exploiting Functional Constraints in Automatic Dominance Bre...

引用

28th international conference on principles and practice of constraint programming, CP 2022

作者： Lee, Jimmy H.M. Zhong, Allen Z. Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin Hong Kong Hong Kong

ISBN: (纸本)9783959772402

Dominance breaking is an effective technique to reduce the time for solving constraint optimization problems. Lee and Zhong propose an automatic dominance breaking framework for a class of constraint optimization problems based on specific forms of objectives and constraints. In this paper, we propose to enhance the framework for problems with nested function calls which can be flattened to functional constraints. In particular, we focus on aggregation functions and exploit such properties as monotonicity, commutativity and associativity to give an efficient procedure for generating effective dominance breaking nogoods. Experimentation also shows orders-of-magnitude runtime speedup using the generated dominance breaking nogoods and demonstrates the ability of our proposal to reveal dominance relations in the literature and discover new dominance relations on problems with ineffective or no known dominance breaking constraints. © Jimmy H. M. Lee and Allen Z. Zhong.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A constraint seeker: Finding and ranking global constraints from examples

A constraint seeker: Finding and ranking global constraints ...

引用

17th international conference on principles and practice of constraint programming, CP 2011

作者： Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642237850

In this paper we describe a constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) examples. Based on the given instances the tool returns a ranked list of matching constraints, the rank indicating whether the constraint is likely to be the intended constraint of the user. We give some examples of use cases and generated output, describe the different elements of the search and ranking process, discuss the role of constraint programming in the different tools used, and provide evaluation results over the complete global constraint catalog. the constraint Seeker is an example for the use of generic meta-data provided in the catalog to solve a specific problem. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Specific filtering algorithms for over-constrained problems 7

引用

7th international conference on principles and practice of constraint programming, CP 2001

作者： Petit, thierry Règin, Jean-Charles Bessière, Christian ILOG 1681 route des Dolines Valbonne06560 France 161 rue Ada Montpellier Cedex 534392 France

ISBN: (纸本)3540428631

In recent years, many constraint-specific filtering algorithms have been introduced. Such algorithms use the semantics of the constraint to perform filtering more efficiently than a generic algorithm. the usefulness of such methods has been widely proven for solving constraint satisfaction problems. In this paper, we extend this concept to over constrained problems by associating specific filtering algorithms with constraints that may be violated. We present a paradigm that places no restrictions on the constraint filtering algorithms used. We illustrate our method with a complete study of the All-different constraint. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 78 79 80 81 82 83 84 85 86 87 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：