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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是951-960 订阅

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

详细简洁

排序：

A global constraint combining a sum constraint and difference constraints 6th

引用

6th international conference on principles and practice of constraint programming, CP2000

作者： Régin, Jean-Charles Rueher, Michel ILOG Les Taissounieres HB2 1681 route des Dolines Sophia Antipolis Valbonne06560 France Université de Nice-Sophia-Antipolis I3S ESSI 930 route des Colles – B.P. 145 06903 Sophia-Antipolis France

ISBN: (纸本)3540410538

this paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = ∑xi, and where variables xi are subject to difference constraints of the form xj - xi ≤ c. An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. Classical approaches perform a local consistency filtering after each reduction of the bound of y. the drawback of these approaches comes from the fact that the constraints are handled independently. We introduce here a global constraint that enables to tackle simultaneously the whole constraint system, and thus, yields a more effective pruning of the domains of the xi when the bounds of y are reduced. An efficient algorithm, derived from Dikjstra’s shortest path algorithm, is introduced to achieve interval consistency on this global constraint. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams 28

Peel-And-Bound: Generating Stronger Relaxed Bounds with Mult...

引用

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

作者： Rudich, Isaac Cappart, Quentin Rousseau, Louis-Martin Mathematics and Industrial Engineering Department Polytechnique Montréal Canada Computer Engineering and Software Engineering Department Polytechnique Montréal Canada

ISBN: (纸本)9783959772402

Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still incorporating the library of techniques that conventional solvers have had decades to build. We drew inspiration from the warm-start technique used in conventional solvers to address one of the major challenges faced by decision diagram based methods. Decision diagrams become more useful the wider they are allowed to be, but also become more costly to generate, especially with large numbers of variables. We present a method of peeling off a sub-graph of previously constructed diagrams and using it as the initial diagram for subsequent iterations that we call peel-and-bound. We test the method on the sequence ordering problem, and our results indicate that our peel-and-bound scheme generates stronger bounds than a branch-and-bound scheme using the same propagators, and at significantly less computational cost. © Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A model seeker: Extracting global constraint models from positive examples

A model seeker: Extracting global constraint models from pos...

引用

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

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

ISBN: (纸本)9783642335570

We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. the system is based on the global constraint catalog, providing the library of constraints that can be used in modeling, and the constraint Seeker tool, which finds a ranked list of matching constraints given one or more sample call patterns. We have tested the modeler with 230 examples, ranging from 4 to 6,500 variables, using between 1 and 7,000 samples. these examples come from a variety of domains, including puzzles, sports-scheduling, packing & placement, and design theory. When comparing against manually specified "canonical" models for the examples, we achieve a hit rate of 50%, processing the complete benchmark set in less than one hour on a laptop. Surprisingly, in many cases the system finds usable candidate lists even when working with a single, positive example. © 2012 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

constraint-based verification of client-server protocols 7

引用

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

作者： Delzanno, Giorgio Bultan, Tevfik Dipartimento di Informatica e Scienze dell’Informazione Università di Genova via Dodecaneso 35 16146 Italy Department of Computer Science University of California Santa BarbaraCA93106 United States

ISBN: (纸本)3540428631

We show that existing constraint manipulation technology incorporated in the paradigm of symbolic model checking with rich assertional languages [KMM+97], can be successfully applied to the verification of client-server protocols with a finite but unbounded number of clients. Abstract interpretation is the mathematical bridge between protocol specifications and the constraint-based verification method on heterogeneous data used in the Action Language Verifier, a model checker for CTL [BYK01]. the method we propose is incomplete but fully automatic and sound for safety and liveness properties. Sufficient conditions for termination of the resulting procedures can be derived by using the theory of [ACJT96]. As a case-study, we apply the method to check safety and liveness properties for a formal model of Steve German’s directorybased consistency protocol [PRZ01]. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Modelling exceptionally hard constraint satisfaction problems 3rd

Modelling exceptionally hard constraint satisfaction problem...

引用

3rd international conference on principles and practice of constraint programming, CP 1997

作者： Smith, Barbara M. Grant, Stuart A. School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom

Randomly-generated binary constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an 9;easy-soluble9; region, where problems have many solutions ... 详细信息

ISBN: (纸本)3540637532

Randomly-generated binary constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an 'easy-soluble' region, where problems have many solutions and are almost always easy to solve. However, in this region, systematic search algorithms may occasionally encounter problems which axe extremely expensive to solve. It has been suggested that in these cases, the first few instantiations made by the algorithm create an insoluble subproblem;an exhaustive search of the subproblem to prove its insolubility accounts for the high cost. We propose a model for the occurrence of such subproblems when using the backtracking algorithm. We calculate the probability of their occurrence and estimate their cost. From this, we derive the theoretical cost distribution when the constraint graph is complete and show that it matches the observed cost distribution in this region. We suggest that a similar model would also account for the exceptionally hard problems that have been observed using more sophisticated algorithms. © Springer-Verlag Berlin Heidelberg 1997.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Robust and parallel solving of a network design problem 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Le Pape, Claude Perron, Laurent Régin, Jean-Charles Shaw, Paul ILOG SA 9 rue de Verdun Gentilly CedexF-94253 France

ISBN: (纸本)3540441204

Industrial optimization applications must be "robust," i.e., must provide good solutions to problem instances of different size and numerical characteristics, and continue to work well when side constraints are added. this paper presents a case study in which this requirement and its consequences on the applicability of different optimization techniques have been addressed. An extensive benchmark suite, built on real network design data provided by France Telecom R&D, has been used to test multiple algorithms for robustness against variations in problem size, numerical characteristics, and side constraints. the experimental results illustrate the performance discrepancies that have occurred and how some have been corrected. In the end, the results suggest that we shall remain very humble when assessing the adequacy of a given algorithm for a given problem, and that a new generation of public optimization benchmark suites is needed for the academic community to attack the issue of algorithm robustness as it is encountered in industrial settings. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A framework for decision-based consistencies

A framework for decision-based consistencies

引用

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

作者： Condotta, Jean-François Lecoutre, Christophe CRIL - CNRS UMR 8188 Univ Lille Nord de France Artois LensF-62307 France

ISBN: (纸本)9783642237850

Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most often, variable assignments) and stronger than (generalized) arc consistency have been introduced. In this paper, our ambition is to present a clear picture of decision-based consistencies. We identify four general classes (or levels) of decision-based consistencies, denoted by SφΔ, EφΔ, DφΔ and, study their relationships, and show that known consistencies are particular cases of these classes. Interestingly, this general framework provides us with a better insight into decision-based consistencies, and allows us to derive many new consistencies that can be directly integrated and compared with other ones. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

An algorithm-independent measure of progress for linear constraint propagation 27

An algorithm-independent measure of progress for linear cons...

引用

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

作者： Sofranac, Boro Gleixner, Ambros Pokutta, Sebastian Zuse Institute Berlin Germany TU Berlin Germany HTW Berlin Germany

ISBN: (纸本)9783959772112

Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite convergence. However, these heuristic stopping criteria can pose difficulties for fairly comparing the efficiency of different implementations of iterative propagation algorithms in a real-world setting. Most significantly, the presence of unbounded variable domains in the problem formulation makes it difficult to quantify the relative size of reductions performed on them. In this work, we develop a method to measure - independently of the algorithmic design - the progress that a given iterative propagation procedure has made at a given point in time during its execution. Our measure makes it possible to study and better compare the behavior of bounds propagation algorithms for linear constraints. We apply the new measure to answer two questions of practical relevance: (i) We investigate to what extent heuristic stopping criteria can lead to premature termination on real-world MIP instances. (ii) We compare a GPU-parallel propagation algorithm against a sequential state-of-the-art implementation and show that the parallel version is even more competitive in a real-world setting than originally reported. © Boro Sofranac, Ambros Gleixner, and Sebastian Pokutta.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Factor analytic studies of CSP heuristics

引用

11th international conference on principles and practice of constraint programming - CP 2005

作者： Wallace, Richard J. Cork Constraint Computation Centre Department of Computer Science University College Cork Cork Ireland

ISBN: (纸本)3540292381

Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying variables. In this study factor analysis was used to determine if variation in search efficiency due to different variable ordering heuristics could be analyzed by this method to reveal basic sources of variation. It was found that the variation could be ascribed to two major factors, which appear to be related to contention (immediate failure) and to forward propagation (future failure). this was most clearcut with homogeneous random problems, but similar factor patterns were demonstrated for problems with small-world characteristics. Heuristics can be classified in terms of whether they tend to support one or the other strategy, or whether they balance the two;these differences are reflected in the pattern of loadings on the two major factors. Moreover, improvements in efficiency can be obtained by heuristic combinations ("heuristic synergy") only if the combination includes heuristics that are highly correlated with each factor;therefore, two such heuristics are sufficient. this work represents a step toward understanding the action of heuristics as well as suggesting limits to heuristic performance. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Differential programming via or methods 27

Differential programming via or methods

引用

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

作者： Sweitzer, Shannon Kumar, T. K. Satish Department of Computer Science Department of Physics and Astronomy Department of Industrial and Systems Engineering Information Sciences Institute University of Southern California Los AngelesCA United States

ISBN: (纸本)9783959772112

Systems of ordinary differential equations (ODEs) and partial differential equations (PDEs) are extensively used in many fields of science, including physics, biochemistry, nonlinear control, and dynamical systems. On the one hand, analytical methods for solving systems of ODEs/PDEs mostly remain an art and are largely insufficient for complex systems. On the other hand, numerical approximation methods do not yield a viable analytical form of the solution that is often required for downstream tasks. In this paper, we present an approximate approach for solving systems of ODEs/PDEs analytically using solvers like Gurobi developed in Operations Research (OR). Our main idea is to represent entire functions as Bézier curves/surfaces with to-be-determined control points. the ODEs/PDEs as well as their boundary conditions can then be reformulated as constraints on these control points. In many cases, this reformulation yields quadratic programming problems (QPPs) that can be solved in polynomial time. It also allows us to reason about inequalities. We demonstrate the success of our approach on several interesting classes of ODEs/PDEs. © Shannon Sweitzer and T. K. Satish Kumar.

关键词： Operations research

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 92 93 94 95 96 97 98 99 100 101 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：