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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Timed constraint programming: A declarative approach to usage control 05

Timed constraint programming: A declarative approach to usag...

引用

PPDP'05 - 7th ACM SIGPLAN conference on principles and practice of Declarative programming

作者： Jagadeesan, Radha Marrero, Will Pitcher, Corin Saraswat, Vijay DePaul University Chicago IL 60604 IBM Research Yorktown Heights NY

ISBN: (纸本)1595930906

this paper focuses on policy languages for (role-based) access control [14, 32], especially in their modern incarnations in the form of trust-management systems [9] and usage control [30, 31]. Any (declarative) approach to access control and trust management has to address the following issues: Explicit denial, inheritance, and overriding, and History-sensitive access control Our main contribution is a policy algebra, in the timed concurrent constraint programming paradigm, that uses a form of default constraint programming to address the first issue, and reactive computing to address the second issue. the policy algebra is declarative - programs can be viewed as imposing temporal constraints on the evolution of the system - and supports equational reasoning. the validity of equations is established by coinductive proofs based on an operational semantics. the design of the policy algebra supports reasoning about policies by a systematic combination of constraint reasoning and model checking techniques based on linear time temporal-logic. Our framework permits us to perform security analysis with dynamic state-dependent restrictions. Copyright 2005 ACM.

关键词： Time varying control systems

来源：评论

学校读者我要写书评

暂无评论

Modeling constraint programs with software technology standards

引用

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

作者： Hoche, M Jähnichen, S Fraunhofer FIRST D-12489 Berlin Germany

ISBN: (纸本)3540292381

In [1] Puget argued for a "model-and-run" paradigm for constraint programming. He proposed to develop a standard file format to express CP models. there is no such unified modeling standard available to the CP community, so constraint programs cannot be developed independently from the used CP library and they are hard to maintain. this research targets platform-independent object-oriented modeling of constraint programs. It will be shown how CP models can be expressed using software technology standards, and further how these standards will enable automated transformation and execution of such models. the work reconsiders results published in [2]. there, we have formally shown how the Unified Modeling Language (UML) and the Object constraint Language (OCL) can be used to create well formed models of constraint problems called constraint Network Schemata (CNS). Resting upon this, the author now proposes to see Model Driven Architecture (MDA) as a chance for further research advances. Although this paper mainly presents ideas for the adaption of MDA techniques, some practical results where achieved already in the domain of surgery planning for hospitals. A first prototypic implementation exists which can solve XML-representations of CNS-models with our finite domain constraint solver firstcs. therefore, the CNS-model and the input data of a constraint problem are processed from separate XML files to create a constraint Satisfactory Problem (CSP) in a data-driven way. the CSP is then solved by firstcs and the solution is returned as an XML-file, too. Such processing simplifies the integration into complex business workflows and helps to increase the acceptance of CP in business applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

the comet programming language and system

引用

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

作者： Michel, L Van Hentenryck, P Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)3540292381

COMET is a novel, object-oriented, programming language specifically designed to simplify the implementation of local search algorithms. Comet supports a constraint-based architecture for local search organized around two main components: a declarative component which models the application in terms of constraints and functions, and a search component which specifies the search heuristic and meta-heuristic. constraints, which are a natural vehicle to express combinatorial optimization problems, are differentiable objects in COMET: they maintain a number of properties incrementally and they provide algorithms to evaluate the effect of various operations on these properties. the search component then uses these functionalities to guide the local search using multidimensional, possibly randomized, selectors and first-order control structures such as events, neighbors, and nondeterminism. As a result, COMET programs often feature models similar to those of constraint programming, although the underlying technology is fundamentally different in nature. In particular, COMET models are high-level, compositional, and modular. It is possible to add new constraints and to modify or remove existing ones, without having to worry about the global effect of these changes. COMET also separates the modeling and search components, allowing programmers to experiment with different search heuristics and meta-heuristics without affecting the problem modeling. COMET has been applied to many applications and is often competitive with tailored algorithms for complex applications. this system demonstration illustrates COMET on a variety of applications in resource allocation, facility location, and scheduling. It will cover both the sequential and parallel implementations and the COMET environment. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Repair-based methods for Quantified CSPs

引用

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

作者： Stergiou, K Univ Aegean Dept Informat & Commun Syst Engn Samos Greece

ISBN: (纸本)3540292381

the Quantified CSP (QCSP) is a generalization of the CSP which allows for universally quantified variables. For each possible sequence of assignments to such variables, we have to find a way to set the values of the remaining, existentially quantified, variables so that all the constraints are satisfied. Such problems arise in areas such as planning under uncertainty, model checking, and adversary game playing. QCSPs are starting to attract interest following the development of numerous efficient solvers for the closely related area of QBF. Two approaches have been studied so far;the encoding of QCSPs into QBF, and the generalization of well-known search procedures for CSPs, like FC and MAC, to the quantified case. In this paper we introduce a new approach which utilizes repair-based techniques. We describe a framework for a QCSP solver in which complete and incomplete repair-based methods can be incorporated. We also evaluate such a solver that applies backtracking and local search methods based on the min-conflicts heuristic. Experimental results demonstrate that even simple repair-based techniques can outperform the state-of-the-art solver QCSP-Solve.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

OWL: A description logic based ontology language

引用

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

作者： Horrocks, I Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

ISBN: (纸本)3540292381

Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. they are characterised by the use of various constructors to build complex concepts from simpler ones, an emphasis on the decidability of key reasoning tasks, and by the provision of sound, complete and (empirically) tractable reasoning services. Although they have a range of applications (e.g., reasoning with database schemas and queries [1,2]), DLs are perhaps best known as the basis for ontology languages such as OIL, DAML+OIL and OWL [3]. the decision to base these languages 011 DLs was motivated by a requirement not only that key inference problems (such as class satisfiability and subsumption) be decidable, but that "practical" decision procedures and "efficient" implemented systems also be available. that DLs were able to meet the above requirements was the result of extensive research within the DL community over the course of the preceding 20 years or more. this research mapped out a complex landscape of languages, exploring a range of different language constructors, studying the effects of various combinations of these constructors on decidability and worst case complexity, and devising At the same time, work on implementation and optimisation techniques demonstrated that, in spite of the high worst case complexity of key inference problems (usually at least ExpTime), highly optimised DL systems were capable of providing practical reasoning support in the typical cases encountered in realistic applications [4]. With the added impetus provided by the OWL standardisation effort, DL systems are now being used to provide computational services for a rapidly expanding range of ontology tools and applications [5-9]. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Breaking all value symmetries in surjection problems

引用

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

作者： Puget, Jean-François ILOG 9 avenue de Verdun 94253 Gentilly France

ISBN: (纸本)3540292381

We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear number of binary constraints. the set of constraints is automatically computed from the symmetries of the problem using computational group theory. Our method applies to problems where every value is taken by at least one variable. Such problems occur frequently in practice. Various experiments show that our method is extremely effective when compared to previously published methods. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Tractable clones of polynomials over semigroups

引用

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

作者： Dalmau, V Gavaldà, R Tesson, P thérien, D Univ Pompeu Fabra Dept Tecnol Barcelona Spain Univ Politecn Cataluna LSI Dept Software Catalunya Spain Univ Laval Dept Informat & Genie Logiciel Quebec City PQ G1K 7P4 Canada McGill Univ Sch Comp Sci Montreal PQ H3A 2T5 Canada

ISBN: (纸本)3540292381

We contribute to the algebraic study of the complexity of constraint satisfaction problems. We give a new sufficient condition on a set of relations F over a domain S for the tractability of CSP(Gamma): if S is a block-group (a particular class of semigroups) of exponent omega and Gamma is a set of relations over S preserved by the operation defined by the polynomial f(x, y, z) = xy(omega-1)z over S, then CSP (F) is tractable. this theorem strictly improves on results of Feder and Vardi and Bulatov et al. and we demonstrate it by reproving an upper bound of Klima et al. We also investigate systematically the tractability of CSP(Gamma) when Gamma is a set of relations closed under operations that are all expressible as polynomials over a finite semigroup S. In particular, if S is a nilpotent group, we show that CSP(F) is tractable iff one of these polynomials defines a Malt'sev operation, and conjecture that this holds for all groups.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Using constraint programming for solving distance CSP with uncertainty

引用

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

作者： Grandon, C Neveu, B INRIA COPRIN Project I3S CNRSCERMICS F-06902 Sophia Antipolis France

ISBN: (纸本)3540292381

Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP (constraint Satisfaction Problem). Sometimes, the parameters of this kind of problems are determined in an experimental way, and therefore they have an uncertainty degree. A classical approach for solving this class of problems is to solve the CSP without considering the uncertainties, and to obtain a set of solutions without knowing the real solution sub-spaces. A better approach is to apply a branch and prune algorithm to generate a set of disjoint boxes that include all the solution sub-spaces, but without information about independent solution sub-spaces or the different types of boxes. We propose a new methodology built from the combination of both previous approaches and a feasibility checker for tackling uncertainties in a CSP formed by distance constraints. A distance constraint c between two points P_i and P _j in a n-dimensional space can be expressed as c(P_i, P_j): ∑_k=1ⁿ(x_ik - x _jk)² = d_ij², where x_ik is the k-th coordinate of the point P_i, and d_ij is the distance value between them. In this class of problems, all fixed values are called parameters. When a CSP has parameters with interval values, it is called CSP with uncertainties. In our methodololy, the main idea consists in solving the CSP without taking into account the uncertainties, by replacing each parameter with interval value by the middle point of the interval, and applying a SSA (solution separation algorithm) to calculate a set of sub-domains. the SSA calculates the equation of the median plane between each pair of solutions. then, for each solution found, we solve a new CSP built from the original CSP (with uncertainties) and a set of plane inequations. the sub-domain defined by the conjunction of all inequations is equivalent to the sub-space of a Vo

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Distributed constraints for large-scale scheduling problems

引用

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

作者： Abril, Montserrat Salido, Miguel A. Barber, Federico DSIC Universidad Politécnica de Valencia Camino de Vera s/n 46022 Valencia Spain

In this work, we present a distributed model for solving large-scale CSPs. Our technique carries out a partition over the constraint network by a graph partitioning software, such as each subproblem is as independent ... 详细信息

ISBN: (纸本)3540292381

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Beyond finite domains: the all different and global cardinality constraints

引用

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

作者： Quimper, Claude-Guy Walsh, Toby School of Computer Science University of Waterloo Canada NICTA UNSW Sydney Australia

We describe how the propagator for the ALL-DIFFERENT constraint can be generalized to prune variables whose domains are not just simple finite integer domains. We show, for example, how it can be used to propagate set... 详细信息

ISBN: (纸本)3540292381

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：