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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

956 篇 会议
51 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

853 篇 工学
- 833 篇 计算机科学与技术...
- 495 篇 软件工程
- 41 篇 信息与通信工程
- 27 篇 电气工程
- 17 篇 控制科学与工程
- 8 篇 机械工程
- 7 篇 土木工程
- 6 篇 建筑学
- 6 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 4 篇 生物工程
- 3 篇 冶金工程
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 航空宇航科学与技...
530 篇 理学
- 422 篇 数学
- 274 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 物理学
- 7 篇 生物学
- 6 篇 化学
62 篇 管理学
- 54 篇 管理科学与工程(可...
- 34 篇 工商管理
- 10 篇 图书情报与档案管...
7 篇 法学
- 7 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 农学
- 5 篇 作物学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

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

机构

18 篇 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 篇 natl univ singap...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 161 rue ada mont...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 univ st andrews ...
5 篇 ben gurion univ ...
5 篇 department of co...
5 篇 univ coll cork c...

作者

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

语言

1,023 篇 英文
3 篇 中文

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

共 1026 条记录，以下是381-390 订阅

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

详细简洁

排序：

Revisiting the tree constraint

Revisiting the tree constraint

引用

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

作者： Fages, Jean-Guillaume Lorca, Xavier École des Mines de Nantes INRIA LINA UMR CNRS 6241 Nantes Cedex 3FR-44307 France

ISBN: (纸本)9783642237850

this paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. this result allows to tackle larger scale problems involving graph partitioning. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Synthesis of search algorithms from high-level CP models

Synthesis of search algorithms from high-level CP models

引用

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

作者： Elsayed, Samir A. Mohamed Michel, Laurent Computer Science Department University of Connecticut United States

ISBN: (纸本)9783642237850

the ability to specify CP programs in terms of a declarative model and a search procedure is instrumental to the industrial CP successes. Yet, writing search procedures is often difficult for novices or people accustomed to model & run approaches. the viewpoint adopted in this paper argues for the synthesis of a search from the declarative model to exploit the problem instance structures. the intent is not to eliminate the search. Instead, it is to have a default that performs adequately in the majority of cases while retaining the ability to write full-fledged procedures. Empirical results demonstrate that the approach is viable, yielding procedures approaching and sometimes rivaling hand-crafted searches. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Habanero-Java: the new adventures of Old X10 11

Habanero-Java: The new adventures of Old X10

引用

9th international conference on principles and practice of programming in Java, PPPJ 2011

作者： Cav´e, Vincent Zhao, Jisheng Shirako, Jun Sarkar, Vivek Rice University United States

ISBN: (纸本)9781450309356

In this paper, we present the Habanero-Java (HJ) language developed at Rice University as an extension to the original Java-based definition of the X10 language. HJ includes a powerful set of taskparallel programming constructs that can be added as simple extensions to standard Java programs to take advantage of today's multicore and heterogeneous architectures. the language puts a particular emphasis on the usability and safety of parallel constructs. For example, no HJ program using async, finish, isolated, and phaser constructs can create a logical deadlock cycle. In addition, the future and data-driven task variants of the async construct facilitate a functional approach to parallel programming. Finally, any HJ program written with async, finish, and phaser constructs that is data-race free is guaranteed to also be deterministic. HJ also features two key enhancements that address well known limitations in the use of Java in scientific computing - the inclusion of complex numbers as a primitive data type, and the inclusion of array-views that support multidimensional views of onedimensional arrays. the HJ compiler generates standard Java classfiles that can run on any JVM for Java 5 or higher. the HJ runtime is responsible for orchestrating the creation, execution, and termination of HJ tasks, and features both work-sharing and work-stealing schedulers. HJ is used at Rice University as an introductory parallel programming language for second-year undergraduate students. A wide variety of benchmarks have been ported to HJ, including a full application that was originally written in Fortran 90. HJ has a rich development and runtime environment that includes integration with DrJava, the addition of a data race detection tool, and service as a target platform for the Intel Concurrent Collections coordination language © 2011 ACM.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Routefinder: Efficiently finding k shortest paths using constraint programming

Routefinder: Efficiently finding k shortest paths using cons...

引用

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

作者： Lefebvre, Michel P. Puget, Jean-François Vilím, Petr IBM 21 chemin de la Sauvegarde Ecully69130 France IBM 350 Avenue de Boulouris Saint Raphael83700 France IBM V Parku 2294/4 Praha 4Chodov148 00 Czech Republic

ISBN: (纸本)9783642237850

In this paper, we describe a constraint programming (CP) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the nature of the business constraints rule out known algorithms such as Dijkstra’s. Indeed, one cannot unfold all constraints into a directed graph as the resulting graph would be too large. Given an origin and destination (two places), the problem is to decide which ships should be used (routes), and when and where the containers should be loaded from one ship to another (connections), while satisfying many business rules specified by the transportation company. the CP model described in this paper is quite simple, it doesn’t use any specialized constraints, but it is surprisingly effective. Queries for the best route are answered in a matter of a second or fraction of a second, although the problem is very large: around 900 places, 2,300 routes, 22,000 connections and 4,200 business rules. the system gracefully handles 100,000 requests a day on a single server. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Filtering algorithms for discrete cumulative problems with overloads of resource

Filtering algorithms for discrete cumulative problems with o...

引用

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

作者： De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France

ISBN: (纸本)9783642237850

Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. Moreover, this capacity is not necessarily always the same during the scheduling period. this article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilím’s Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Value ordering for finding all solutions: Interactions with adaptive variable ordering

Value ordering for finding all solutions: Interactions with ...

引用

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

作者： Mehta, Deepak O’Sullivan, Barry Quesada, Luis Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642237850

We consider the impact of value ordering heuristics on the search effort required to find all solutions, or proving none exist, to a constraint satisfaction problem in k-way branching search. We show that when the variable ordering heuristic is adaptive, the order in which the values are assigned to variables can make a significant difference in all measures of search effort. We study in depth an open issue regarding the relative merit of traditional value heuristics, and their complements, when searching for all solutions. We also introduce a lazy version of k-way branching and study the effect of value orderings on finding all solutions when it is used. this paper motivates a new and fruitful line of research in the study of value ordering heuristics for proving unsatisfiability. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Proving symmetries by model transformation

Proving symmetries by model transformation

引用

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

作者： Mears, Christopher Niven, Todd Jackson, Marcel Wallace, Mark Faculty of IT Monash University Australia Department of Mathematics La Trobe University Australia

ISBN: (纸本)9783642237850

the presence of symmetries in a constraint satisfaction problem gives an opportunity for more efficient search. Within the class of matrix models, we show that the problem of deciding whether some well known permutations are model symmetries (solution symmetries on every instance) is undecidable. We then provide a new approach to proving the model symmetries by way of model transformations. Given a model M and a candidate symmetry σ, the approach first syntactically applies σ to M and then shows that the resulting model σ(M) is semantically equivalent to M. We demonstrate this approach with an implementation that reduces equivalence to a sentence in Presburger arithmetic, using the modelling language MiniZinc and the term re-writing language Cadmium, and show that it is capable of proving common symmetries in models. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Pruning rules for constrained optimisation for conditional preferences

Pruning rules for constrained optimisation for conditional p...

引用

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

作者： Wilson, Nic Trabelsi, Walid Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642237850

A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a CP-net). this involves checking at each leaf node if the corresponding solution of the CSP is dominated by any of the optimal solutions found so far;if not, then we add this solution to the set of optimal solutions. this kind of algorithm can clearly be computationally expensive if the number of solutions is large. At a node N of the search tree, with associated assignment b to a subset of the variables B, it may happen that, for some previously found solution α, either (a) α dominates all extensions of b;or (b) α does not dominate any extension of a. the algorithm can be significantly improved if we can find sufficient conditions for (a) and (b) that can be efficiently checked. In case (a), we can backtrack since we need not continue the search below N;in case (b), α does not need to be considered in any node below the current node N. We derive a sufficient condition for (b), and three sufficient conditions for (a). Our experimental testing indicates that this can make a major difference to the efficiency of constrained optimisation for conditional preference theories including CP-nets. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds

Pseudo-tree-based incomplete algorithm for distributed const...

引用

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

作者： Okimoto, Tenda Joe, Yongjoon Iwasaki, Atsushi Yokoo, Makoto Faltings, Boi Kyushu University Fukuoka8190395 Japan LausanneCH-1015 Switzerland

ISBN: (纸本)9783642237850

A Distributed constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, considering faster incomplete algorithms is necessary for large-scale applications. Most incomplete algorithms generally do not provide any guarantees on the quality of solutions. Some notable exceptions are DALO, the bounded max-sum algorithm, and ADPOP. In this paper, we develop a new solution criterion called p-optimality and an incomplete algorithm for obtaining a p-optimal solution. the characteristics of this algorithm are as follows: (i) it can provide the upper bounds of the absolute/relative errors of the solution, which can be obtained a priori/a posteriori, respectively, (ii) it is based on a pseudo-tree, which is a widely used graph structure in complete DCOP algorithms, (iii) it is a one-shot type algorithm, which runs in polynomial-time in the number of agents n assuming p is fixed, and (iv) it has adjustable parameter p, so that agents can trade-off better solution quality against computational overhead. the evaluation results illustrate that this algorithm can obtain better quality solutions and bounds compared to existing bounded incomplete algorithms, while the run time of this algorithm is shorter. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：