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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

61 篇 会议
4 册 图书

馆藏范围

65 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

49 篇 理学
- 40 篇 系统科学
- 28 篇 数学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
49 篇 工学
- 47 篇 计算机科学与技术...
- 40 篇 软件工程
- 4 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 石油与天然气工程
- 1 篇 环境科学与工程（可...
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 5 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学

主题

16 篇 constraint theor...
9 篇 constraint satis...
6 篇 constraint progr...
3 篇 constrained opti...
3 篇 mathematical log...
3 篇 programming lang...
3 篇 logics and meani...
2 篇 model checking
2 篇 computational ge...
2 篇 discrete mathema...
2 篇 numeric computin...
2 篇 distributed cons...
2 篇 scheduling
2 篇 cryptography
2 篇 algorithm analys...
1 篇 smart homes
1 篇 traveling salesm...
1 篇 learning systems
1 篇 frequency alloca...
1 篇 computational co...

机构

3 篇 cork constraint ...
3 篇 cork constraint ...
2 篇 university of co...
2 篇 optimization res...
2 篇 mines de nantes
2 篇 national ict aus...
2 篇 brown univ provi...
2 篇 icteam universit...
1 篇 free univ amster...
1 篇 sics lagerhyddsv...
1 篇 department of op...
1 篇 antwerp maritime...
1 篇 irit university ...
1 篇 university of ge...
1 篇 university of co...
1 篇 florida inst tec...
1 篇 cermics 2004 rou...
1 篇 sics kista 16429
1 篇 department of co...
1 篇 nicta unsw

作者

6 篇 beldiceanu nicol...
5 篇 carlsson mats
4 篇 stuckey peter j.
4 篇 o'sullivan barry
3 篇 van hentenryck p...
3 篇 simonis helmut
3 篇 michel laurent
2 篇 pearson justin
2 篇 solnon christine
2 篇 dullaert wout
2 篇 hirayama katsuto...
2 篇 rueher michel
2 篇 matsui toshihiro
2 篇 cooper martin c.
2 篇 laviolette franç...
2 篇 chu geoffrey
2 篇 michel laurent d...
2 篇 van schaeren row...
2 篇 hebrard emmanuel
2 篇 flener pierre

语言

64 篇 英文
1 篇 中文

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

共 65 条记录，以下是21-30 订阅

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

详细简洁

排序：

A pseudo-boolean set covering machine

A pseudo-boolean set covering machine

引用

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

作者： Germain, Pascal Giguère, Sébastien Roy, Jean-Francis Zirakiza, Brice Laviolette, François Quimper, Claude-Guy Département d'Informatique et de Génie Logiciel Université Laval Québec QC Canada

ISBN: (纸本)9783642335570

the Set Covering Machine (SCM) is a machine learning algorithm that constructs a conjunction of Boolean functions. this algorithm is motivated by the minimization of a theoretical bound. However, finding the optimal conjunction according to this bound is a combinatorial problem. the SCM approximates the solution using a greedy approach. Even though SCM seems very efficient in practice, it is unknown how it compares to the optimal solution. To answer this question, we present a novel pseudo-Boolean optimization model that encodes the minimization problem. It is the first time a constraint programming approach addresses the combinatorial problem related to this machine learning algorithm. Using that model and recent pseudo-Boolean solvers, we empirically show that the greedy approach is surprisingly close to the optimal. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Improved bounded max-sum for distributed constraint optimization

Improved bounded max-sum for distributed constraint optimiza...

引用

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

作者： Rollon, Emma Larrosa, Javier Departament de Llenguatges I Sistemes Informàtics Universitat Politècnica de Catalunya Spain

ISBN: (纸本)9783642335570

Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirically proved to be within a small percentage of the optimal solution on low and moderately dense problems, in this paper we show that its theoretical approximation ratio is overestimated, thus overshadowing its good performance. We propose a new algorithm, called Improved Bounded Max-Sum, whose approximate solutions are at least as good as the ones found by Bounded Max-Sum and with a tighter approximation ratio. Our empirical evaluation shows that the new approximation ratio is significantly tighter. © 2012 Springer-Verlag.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A generic method for identifying and exploiting dominance relations

A generic method for identifying and exploiting dominance re...

引用

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

作者： Chu, Geoffrey Stuckey, Peter J. National ICT Australia Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9783642335570

Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions of dominance breaking, and a generic method for identifying and exploiting dominance relations via dominance breaking constraints. We also give a generic proof of the correctness and compatibility of symmetry breaking constraints, conditional symmetry breaking constraints and dominance breaking constraints. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A constraint programming approach for the traveling purchaser problem

A constraint programming approach for the traveling purchase...

引用

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

作者： Cambazard, Hadrien Penz, Bernard G-SCOP Université de Grenoble / Grenoble-INP / UJF-Grenoble 1 / CNRS France

ISBN: (纸本)9783642335570

We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraint programming and Lagrangean relaxation. the TPP is a generalization of the Traveling Salesman Problem involved in many real-world applications. Given a set of markets providing products at different prices and a list of products to be purchased, the problem is to determine the route minimizing the sum of the traveling and purchasing costs. We propose in this paper an efficient approach when the number of markets visited in an optimal solution is low. We believe that the real-world applications of this problem often assume a bounded number of visits when they involve a physical routing. It is an actual requirement from our industrial partner which is developing a web application to help their customers' shopping planning. the approach is tested on academic benchmarks. It proves to be competitive with a state of the art branch-and-cut algorithm and can provide in some cases new optimal solutions for instances with up to 250 markets and 200 products. © 2012 Springer-Verlag.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Distributed constraint-based local search

Distributed constraint-based local search

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Michel, Laurent See, Andrew Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)3540462678

Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed but instead a doubling of the number of cores. Unfortunately, it also places significant conceptual and implementation burden on programmers. this paper aims at addressing this challenge for constraint-based local search (CBLS), whose search procedures typically exhibit inherent parallelism stemming from multistart, restart, or population-based techniques whose benefits have been demonstrated both experimentally and theoretically. the,paper presents abstractions that allows distributed CBLS programs to be close to their sequential and parallel counterparts, keeping the conceptual and implementation overhead of distributed computing minimal. A preliminary implementation in COMET exhibits significant speed-ups in constraint satisfaction and optimization applications. the implementation also scales well with the number of machines. Of particular interest is the observation that generic abstractions of CBLS and cp, such as models and solutions, and advanced control structures such as events and closures, play a fundamental role to keep the distance between sequential and distributed CBLS programs small. As a result, the abstractions directly apply to cp programs using multistarts or restarts procedures.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540859581

ISBN: (纸本)9783540859574

this volume contains the proceedings of the 14th international conference on principles and practice of constraint programming (cp 2008) held in Sydney, Australia, September 14–18, 2008. the conference was held in conjunction with the international conference on Automated Planning and Scheduling (ICAPS 2008) and the international conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the cp conference series is the premier international conference on constraint programming. the conference focuses on all aspects of computing with constraints. the cp conf- ence series is organized by the Association for constraint programming (Acp). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about Acp can be found athttp://www. a4cp. org/. cp 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. the research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee.

关键词： programming Languages, Compilers, Interpreters programming Techniques Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages Computer Appl. in Administrative Data Processing

来源：评论

学校读者我要写书评

暂无评论

the SeqBin constraint revisited

The SeqBin constraint revisited

引用

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

作者： Katsirelos, George Narodytska, Nina Walsh, Toby UBIA INRA Toulouse France NICTA UNSW Sydney Australia

ISBN: (纸本)9783642335570

We revisit the SeqBin constraint [1]. this meta-constraint subsumes a number of important global constraints like Change [2], Smooth [3] and IncreasingNValue [4]. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted n-partite graph. Our propagator enforces domain consistency in O(nd 2) and, for special cases of SeqBin that include Change, Smooth and IncreasingNValue in O(nd) time. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint-based register allocation and instruction scheduling

Constraint-based register allocation and instruction schedul...

引用

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

作者： Lozano, Roberto Castañeda Carlsson, Mats Drejhammar, Frej Schulte, Christian Sweden School of ICT KTH Royal Institute of Technology Sweden

ISBN: (纸本)9783642335570

this paper introduces a constraint model and solving techniques for code generation in a compiler back-end. It contributes a new model for global register allocation that combines several advanced aspects: multiple register banks (subsuming spilling to memory), coalescing, and packing. the model is extended to include instruction scheduling and bundling. the paper introduces a decomposition scheme exploiting the underlying program structure and exhibiting robust behavior for functions with thousands of instructions. Evaluation shows that code quality is on par with LLVM, a state-of-the-art compiler infrastructure. the paper makes important contributions to the applicability of constraint programming as well as compiler construction: essential concepts are unified in a high-level model that can be solved by readily available modern solvers. this is a significant step towards basing code generation entirely on a high-level model and by this facilitates the construction of correct, simple, flexible, robust, and high-quality code generators. © 2012 Springer-Verlag.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Cardinality reasoning for bin-packing constraint: Application to a tank allocation problem

Cardinality reasoning for bin-packing constraint: Applicatio...

引用

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

作者： Schaus, Pierre Régin, Jean-Charles Van Schaeren, Rowan Dullaert, Wout Raa, Birger ICTEAM Université Catholique de Louvain Belgium University of Nice France Antwerp Maritime Academy Belgium VU University Amsterdam University of Antwerp Netherlands University of Gent Belgium

ISBN: (纸本)9783642335570

Flow reasoning has been successfully used in cp for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality constraint (GCC) available in most of the cp solvers. the BinPacking constraint was introduced by Shaw and mainly uses an independent knapsack reasoning in each bin to filter the possible bins for each item. this paper considers the use of a cardinality/flow reasoning for improving the filtering of a bin-packing constraint. the idea is to use a GCC as a redundant constraint to the BinPacking that will count the number of items placed in each bin. the cardinality variables of the GCC are then dynamically updated during the propagation. the cardinality reasoning of the redundant GCC makes deductions that the bin-packing constraint cannot see since the placement of all items into every bin is considered at once rather than for each bin individually. this is particularly well suited when a minimum loading in each bin is specified in advance. We apply this idea on a Tank Allocation Problem (TAP). We detail our cp model and give experimental results on a real-life instance demonstrating the added value of the cardinality reasoning for the bin-packing constraint. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

the semigroups of order 10

The semigroups of order 10

引用

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

作者： Distler, Andreas Jefferson, Chris Kelsey, Tom Kotthoff, Lars Centro de Álgebra Universidade de Lisboa Lisboa 1649-003 Portugal School of Computer Science University of St. Andrews KY16 9SX United Kingdom

ISBN: (纸本)9783642335570

the number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed constraint Satisfaction to show that the number of non-equivalent semigroups of order 10 is 12,418,001,077,381,302,684. this solves a previously open problem in Mathematics, and has directly led to improvements in constraint Satisfaction technology. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：