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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Improving backtrack search for solving the TCSP

引用

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

作者： Xu, Lin Choueiry, Berthe Y. Constraint Systems Laboratory Department of Computer Science and Engineering University of Nebraska-Lincoln LincolnNE United States

ISBN: (纸本)3540202021

In this paper, we address the task of finding the minimal network of a Temporal constraint Satisfaction Problem (TCSP).We report the integration of three approaches to improve the performance of the exponential-time backtrack search (BT-TCSP) proposed by Dechter et al. [6] for this purpose. the first approach consists of using a new efficient algorithm (∆STP) [21] for solving the Simple Temporal Problem (STP), an operation that must be executed at each node expansion during BT-TCSP. the second approach improves BT-TCSP itself by exploiting the topology of the temporal network. this is accomplished in three ways: finding and exploiting articulation points (AP), checking the graph for new cycles (NewCyc), and using a newheuristic for edge ordering (EdgeOrd). the third approach is a filtering algorithm, ∆AC, which is used as a preprocessing step to BT-TCSP, and which significantly reduces the size of the TCSP [22]. In addition to introducing two new techniques, NewCyc and EdgeOrd, this paper discusses an extensive evaluation of the merits of the above three approaches. Our experiments on randomly generated problems demonstrate significant improvements in the number of nodes visited, constraint checks, and CPU time. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for max-restricted path consistency

引用

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

作者： Grandoni, Fabrizio Italiano, Giuseppe F. Dipartimento di Informatica Sistemi e Produzione Università di Roma "Tor Vergata" Via del Politecnico 1 Roma00133 Italy

ISBN: (纸本)3540202021

A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. the binary constraint satisfaction problem consists in finding a solution for a binary constraints network, that is an instantiation of all the variables which satisfies all the constraints. A value a in the domain of variable x is inconsistent if there is no solution which assigns a to x. Many filtering techniques have been proposed to filter out inconsistent values from the domains. Most of them are based on enforcing a given kind of local consistency. One of the most important such consistencies is max-restricted path consistency. the fastest algorithm to enforce maxrestricted path consistency has a O(end3) time complexity and a O(end) space complexity. In this paper we present two improved algorithms for the same problem. the first still has a O(end3) time complexity, but it reduces the space usage to O(ed). the second improves the time complexity to O(end2.575), and has a O(end2) space complexity. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Greater efficiency for conditional constraint satisfaction

引用

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

作者： Sabin, Mihaela Freuder, Eugene C. Wallace, Richard J. Department of Mathematics and Computer Science Rivier College 420 Main Street NashuaNH03060 United States Cork Constraint Computation Center Department of Computer Science University College Cork Cork Ireland

ISBN: (纸本)3540202021

A conditional constraint satisfaction problem (CCSP) extends a standard constraint satisfaction problem (CPS) with a conditionbased component that controls what variables participate in problem solutions. CCSPs adequately represent configuration and design problems in which selected subsets of variables, rather than the entire variable set, are relevant to final solutions. the only algorithm that is available for CCSP and operates directly on the original, unreformulated CCSP statement has been basic backtrack search. Reformulating CCSPs into standard CSPs has been proposed in order to bring the full arsenal of CSP algorithms to bear. One reformulation approach adds null values to variable domains and transforms CCSP constraints into CSP constraints. However, a complete null-based reformulation of CCSPs has not been available. In this paper we provide more advanced algorithms for CCSP and a full null-based reformulation into standard CSP. thorough testing reveals that the advanced algorithms perform up to two orders of magnitude better than plain backtracking, but that realizing practical advantages from reformulation is problematic. the advanced algorithms extend forward checking and maintaining arc consistency to CCSPs. the null-based reformulation improves on the preliminary findings in [1] by removing the limitation on multiple activation, and by localizing changes. It identifies and addresses a difficulty presented by activity cycles. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Tractability by approximating constraint languages

引用

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

作者： Green, Martin J. Cohen, David A. Department of Computer Science Royal Holloway University of London United Kingdom

ISBN: (纸本)3540202021

A constraint satisfaction problem instance consists of a collection of variables that need to have values assigned to them. the assignments are limited by constraints that force the values taken by certain collections of variables (the constraint scopes) to satisfy specified properties (the constraint relations). As the general CSP problem is NP-hard there has been significant effort devoted to discovering tractable subproblems of the CSP. the structure of a CSP instance is defined to be the hypergraph formed by the constraint scopes. Restricting the possible structure of the CSP instances has been a successful way of identifying tractable subproblems. the language of a CSP instance is defined to be the set of constraint relations of the instance. Restricting the language allowed for CSP instances has also yielded many interesting tractable subproblems. Almost all known tractable subproblems are either structural or relational. In this paper we construct tractable subproblems of the general CSP that are neither defined by structural nor relational properties. these new tractable classes are related to tractable languages in much the same way that general decompositions (cutset, tree-clustering, etc.) are related to acyclic decompositions. It may well be that our results will begin to make language based tractability of more practical interest. We show that our theory allows us to properly extend the binary maxclosed language based tractable class, which is maximal as a tractable binary constraint language. Our theory also explains the tractability of the constraint representation of the Stable Marriage Problem which has not been amenable to existing explanations of tractability. In fact we provide a uniform explanation for the tractability of the class of maxclosed CSPs and the SMP. there has been much work done on so called renamable HORN theories which are a tractable subproblem of SAT. It has been shown that renamable HORN theories are tractably identifiable and

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Exploiting multidirectionality in coarse-grained arc consistency algorithms

引用

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

作者： Lecoutre, Christophe Boussemart, Frédéric Hemery, Fred CNRS FRE 2499 Rue de l’université SP 16 Lens cedex62307 France

ISBN: (纸本)3540202021

Arc consistency plays a central role in solving constraint Satisfaction Problems. this is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been independently presented by their authors. this algorithm which is considered as a refinement of the basic algorithm AC3 has the advantage of being simple and competitive. However, it does not take into account constraint bidirectionality as AC7 does. In this paper, we address this issue, and, in particular, introduce two new algorithms called AC3.2 and AC3.3 which benefit from good properties of both AC3 and AC7. Indeed, AC3.2 and AC3.3 are as easy to implement as AC3 and take advantage of bidirectionality as AC7 does. More precisely, AC3.2 is a general algorithm which partially exploits bidirectionality whereas AC3.3 is a binary algorithm which fully exploits bidirectionality. It turns out that, when Maintaining Arc Consistency during search, MAC3.2, due to a memorization effect, is more efficient than MAC3.3 both in terms of constraint checks and cpu time. Compared to MAC2001/3.1, our experimental results show that MAC3.2 saves about 50% of constraint checks and, on average, 15% of cpu time. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Checking properties of Heap-Manipulating procedures with a constraint solver

Checking properties of Heap-Manipulating procedures with a c...

引用

9th international conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003 Held as Part of the Joint European conferences on theory and practice of Software, ETAPS 2003

作者： Vaziri, Mandana Jackson, Daniel Laboratory for Computer Science Massachusetts Institute of Technology Cambridge MA United States

ISBN: (纸本)3540008985

A method for finding bugs in object-oriented code is presented. It is capable of checking complex user-defined structural properties - that is, of the configuration of objects on the heap - and generates counterexample traces with no false alarms. It requires no annotation beyond the specification to be checked, and is fully automatic. the method relies on a three-step translation: from code to a formula in a first-order relational logic, then to a propositional formula, and finally to conjunctive normal form. An off-the-shelf SAT solver is then used to find a solution that constitutes a counterexample. this underlying scheme, presented previously, does not scale readily. In this paper, we show how a suite of optimizations results in much improved scalability. the optimizations are based on a special treatment of relations that are known to be functional, and target all steps. the effect of the optimizations is demonstrated by application to the analysis of a red-black tree implementation. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Integrating finite domain constraints and CLP with sets 03

Integrating finite domain constraints and CLP with sets

引用

Proceedings of the 5th ACM SIGPLAN international conference on principles and practice of declaritive programming

作者： A. Dal Palú A. Dovier E. Pontelli G. Rossi Università di Udine New Mexico State University Università di Parma

ISBN: (纸本)9781581137057

In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP(SET) and CLP(FD). this work demonstrates that it is possible to provide efficient executions (through CLP(FD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers.

关键词： constraint logic programming programming with sets

来源：评论

学校读者我要写书评

暂无评论

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

引用

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

ISBN: (纸本)3540441204

the proceedings contain 83 papers. the special focus in this conference is on Innovative Applications and Posters. the topics include: Reduced cost-based ranking for generating promising subproblems;integrating constraint and integer programming for the orthogonal latin squares problem;on optimal correction of inconsistent linear constraints;temporal planning through mixed integer programming;a new multi-resource cumulatives constraint with negative heights;global constraints for lexicographic orderings;a global filtering algorithm for handling systems of quadratic equations and inequations;amplification of search performance through randomization of heuristics;computing the envelope for stepwise-constant resource allocations;local probing applied to scheduling;recovering and exploiting structural knowledge from CNF formulas;towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation;accelerating random walks;scaling and probabilistic smoothing;learning and solving soft temporal constraints;opportunistic specialization in russian doll search;range-based algorithm for max-CSP;resolution complexity of random constraints;constraint satisfaction, bounded treewidth, and finite-variable logics;determining the number of solutions to binary CSP instances;consistency checking for qualitative spatial reasoning with cardinal directions;open constraint satisfaction;arc-consistency for quantified constraints;secure distributed constraint satisfaction;partial symmetry breaking;symmetry breaking revisited;breaking row and column symmetries in matrix models;inferring constraint types in constraint programming;controlling embedded systems by reasoning about hidden state;the adaptive constraint engine;indexical-based solver learning;restart policies with dependence among runs and on the edge of planning and scheduling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Finding all minimal unsatisfiable subsets 03

Finding all minimal unsatisfiable subsets

引用

Proceedings of the 5th ACM SIGPLAN international conference on principles and practice of declaritive programming

作者： Maria Garcia de la Banda Peter J. Stuckey Jeremy Wazny Monash University Australia University of Melbourne Australia

ISBN: (纸本)9781581137057

An unsatisfiable set of constraints is minimal if all its (strict) subsets aresatisfiable.A number of forms of error diagnosis, including circuit error diagnosis and type error diagnosis, require finding all minimal unsatisfiable subsets of a given set of constraints (representing an error), in order to generate the best explanation of the error. In this paper we give algorithms for efficiently determining all minimal unsatisfiable subsets for any kind of constraints. We show how taking into account notions of independence of constraints and using incremental constraint solvers can significantly improve the calculation of these subsets.

关键词： minimal unsatisfiable subsets constraint solving

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：