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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

68 篇 会议
4 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 64 篇 计算机科学与技术...
- 52 篇 软件工程
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 环境科学与工程（可...
17 篇 理学
- 14 篇 系统科学
- 9 篇 数学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...

主题

18 篇 constraint theor...
10 篇 constraint satis...
3 篇 mathematical log...
3 篇 programming tech...
3 篇 programming lang...
3 篇 constraint progr...
3 篇 logics and meani...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 model-driven vis...
2 篇 problem solving
2 篇 modeling languag...
2 篇 alldifferent con...
2 篇 constraint optim...
2 篇 semantics
2 篇 constraint-based...
2 篇 optimization alg...
2 篇 heuristic search
1 篇 traveling salesm...
1 篇 genetic programm...

机构

4 篇 natl univ irelan...
4 篇 kth royal inst t...
3 篇 univ connecticut...
3 篇 brown univ provi...
2 篇 univ bologna dei...
2 篇 univ cote azur c...
2 篇 nicta nsw
2 篇 ecole polytech m...
2 篇 univ nottingham ...
2 篇 intel corp haifa
2 篇 univ coll cork c...
2 篇 cornell univ dep...
2 篇 ecole polytech d...
2 篇 univ oxford comp...
2 篇 brown univ dept ...
2 篇 natl univ irelan...
1 篇 inra toulouse
1 篇 university of ne...
1 篇 ecole polytech f...
1 篇 cnrs fre 2499 ru...

作者

5 篇 stuckey peter j.
5 篇 o'sullivan barry
4 篇 van hentenryck p...
4 篇 bessiere christi...
4 篇 hebrard emmanuel
4 篇 lecoutre christo...
4 篇 schulte christia...
4 篇 pesant gilles
3 篇 zanarini alessan...
3 篇 michel laurent
3 篇 milano michela
2 篇 prestwich steven
2 篇 miguel ian
2 篇 hnich brahim
2 篇 tarim s. armagan
2 篇 gent ian p.
2 篇 rossi roberto
2 篇 beldiceanu nicol...
2 篇 lombardi michele
2 篇 meseguer pedro

语言

75 篇 英文

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

共 75 条记录，以下是61-70 订阅

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

详细简洁

排序：

Pruning for the minimum constraint family and for the number of distinct values constraint family 1

引用

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

作者： Beldiceanu, Nicolas SICS Lägerhyddsvägen 18 UppsalaSE-75237 Sweden

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

the paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. this is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint "at most n distinct values for a set of variables". this can be considered as the counterpart of Regin’s algorithm for the alldifferent constraint where one enforces having at least n distinct values for a given set of n variables. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Frequency allocation

来源：评论

学校读者我要写书评

暂无评论

Model-driven visualizations of constraint-based local search

Model-driven visualizations of constraint-based local search

引用

13th international conference on principles and practice of constraint programming (cp 2007)

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

ISBN: (纸本)3540749691

Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a tedious activity requiring significant time and expertise. this paper presents a framework for the visualization of constraint-based local search (CBLS) algorithms. Given a high-level model and a declarative visualization specification, the CBLS visualizer systematically produces animations to visualize constraints and objectives, violations, and conflicts, as well as the temporal behavior of these measures. the visualization specification is declarative and typically composed of a triple (what,where,how) indicating what to display, where, and with which graphical objects. the visualizer architecture is compositional and extensible. It provides building blocks which can be assembled freely by the user and focuses almost exclusively on static aspects, the dynamic aspects being automated by the use of invariants. the paper highlights various functionalities of the visualizer and describes a blueprint for its implementation.

关键词： Model-driven visualization constraint-based local search Optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Feature term subsumption using constraint programming with basic variable symmetry

Feature term subsumption using constraint programming with b...

引用

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

作者： Ontañón, Santiago Meseguer, Pedro Computer Science Department Drexel University Philadelphia PA 19104 United States IIIA-CSIC Universitat Autònoma de Barcelona Bellaterra 08193 Spain

ISBN: (纸本)9783642335570

Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide usage is that their basic operation, subsumption, has a very high computational cost. constraint programming is a very suitable technique to implement that operation, in some cases providing orders of magnitude speed-ups with respect to the standard subsumption approach. In addition, exploiting a basic variable symmetry -that often appears in Feature Terms databases- causes substantial additional savings. We provide experimental results of the benefits of this approach. © 2012 Springer-Verlag.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Cutting planes in constraint programming: An hybrid approach 6th

引用

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

作者： Focacci, Filippo Lodi, Andrea Milano, Michela Dipartimento di Ingegneria Università di Ferrara Italy D.E.I.S Università di Bologna Italy

ISBN: (纸本)3540410538

In recent years, a growing number of attempts have been performed in order to integrate well known Operations Research(OR) techniques in constraint programming (cp) tools. the aim of the integration is to maintain the modelling facilities of the cp paradigm, while improving its performances by exploiting effective OR techniques. In our previous work, we proposed the use of optimization constraints [9], embedding a linear relaxation of the constraint itself and performing pruning on the basis of costs. In particular, domain values can be removed whenever it can be shown that their assignment will necessarily lead to solutions worse than the best solution found. In this setting, the use of cutting planes in global constraints allows to tighten the relaxation so as to infer more accurate bounds on the problem. We propose different ways of using cutting-planes in optimization constraints achieving different levels of tightness of the integration and pruning power. Even if the proposed technique is general, we use as testing application the Travelling Salesman Problem (TSPs) and its time constrained variant. Computational results compare different relaxations in terms of pruning achieved and computational complexity. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming – cp 2010 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： David Cohen

ISBN: (数字)9783642153969

ISBN: (纸本)9783642153952

the 16th annual international conference on the principles and practice of constraint programming (cp 2010) was held in St. Andrews, Scotland, during September 6–10, 2010. We would like to thank our sponsors for their generous support of this event. this conference is concerned with all aspects of computing with constraints, including:theory,algorithms,applications,environments,languages,modelsand systems. We received a wide variety of submissions, each of which was reviewed by at least three referees. Referees were chosen for each submission by an initial bidding process where Program Committee members chose papers from their area of interest. the range of expertise represented by the large Program C- mittee meant that almost all submissions were reviewed by subject experts on the Program Committee, or by colleagues chosen by members of the Program Committee for their particular expertise. Papers weresolicitedeither as long (15 page), or short (8 page) submissions. Short-paper submissions were refereed to exactly the same high standards as long-paper submissions but naturally were expected to contain a smaller quantity of new material. thus there is no disti- tion in these proceedings between short and long papers. I used the excellent EasyChair conference management system to support this process of reviewing, and for the collation and organization of these proceedings. Submissions were made either to the applications track or to the research track. therewere101(23short)researchtracksubmissionsofwhich36(8short) wereaccepted,whichisa36%(35%ofshort)acceptancerate. Applicationstrack submissions received special consideration and the acceptance rate was sign- cantly higher than for the research track.

关键词： Software Engineering/programming and Operating Systems programming Techniques programming Languages, Compilers, Interpreters Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Logics and Meanings of Programs

来源：评论

学校读者我要写书评

暂无评论

Accelerating random walks 8th

引用

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

作者： Wei, Wei Selman, Bart Department of Computer Science Cornell University IthacaNY14853 United States

ISBN: (纸本)3540441204

In recent years, there has been much research on local search techniques for solving constraint satisfaction problems, including Boolean satisfiability problems. Some of the most successful procedures combine a form of random walk with a greedy bias. these proceduresare quite effective in a number of problem domains, for example,constraint-based planning and scheduling, graph coloring, and hard random problem instances. However, in other structured domains,backtrack-style procedures are often more effective. We introduce a technique that leads to significant speedups of random walk style procedures on structured problem domains. Our method identifies long range dependencies among variables in the underlying problem instance. Such dependencies are made explicit by adding new problem constraints. these new constraints can be derived efficiently, and, literally, "accelerate" the Random Walk search process. We provide a formal analysis of our approach and an empirical validation on a recent benchmark collection of hardware verification problems. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

the balance constraint family

The balance constraint family

引用

20th international conference on the principles and practice of constraint programming, cp 2014

作者： Bessiere, Christian Hebrard, Emmanuel Katsirelos, George Kiziltan, Zeynep Picard-Cantin, Émilie Quimper, Claude-Guy Walsh, Toby CNRS University of Montpellier France LAAS-CNRS Toulouse France INRA Toulouse France DISI University of Bologna Italy Université Laval Canada NICTA University of New South Wales Australia

ISBN: (纸本)9783319104270

the Balance constraint introduced by Beldiceanu ensures solutions are balanced. this is useful when, for example, there is a requirement for solutions to be fair. Balance bounds the difference B between the minimum and maximum number of occurrences of the values assigned to the variables. We show that achieving domain consistency on Balance is NP-hard. We therefore introduce a variant, AllBalance with a similar semantics that is only polynomial to propagate. We consider various forms of AllBalance and focus on AtMostallBalance which achieves what is usually the main goal, namely constraining the upper bound on B. We provide a specialized propagation algorithm, and a powerful decomposition both of which run in low polynomial time. Experimental results demonstrate the promise of these new filtering methods. © 2014 Springer international Publishing Switzerland.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Suggestion strategies for constraint-based Matchmaker agents 4th

引用

4th international conference on principles and practice of constraint programming, cp 1998

作者： Freuder, Eugene C. Wallace, Richard J. University of New Hampshire DurhamNH03824 United States

ISBN: (纸本)3540652248

In this paper we describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition and satisfaction. Matchmaking agents are conceived as constraint- based solvers that interact with other, possibly human, agents (Customers). the Matchmaker provides potential solutions ("suggestions") based on partial knowledge, while gaining further information about the problem itself from the other agent through the latterߣs evaluation of these suggestions. the dialog between Matchmaker and Customer results in iterative improvement of solution quality, as demonstrated in simple simulations. We also show empirically that this paradigm supports "suggestion strategies" for finding acceptable solutions more efficiently or for increasing the amount of information obtained from the Customer. this work also indicates some ways in which the tradeoff between these two metrics for evaluating performance can be handled. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Box constraint collections for adhoc constraints

引用

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

作者： Cheng, Chi Kan Lee, Jimmy Ho Man Stuckey, Peter J. Dept of Comp. Sci. and Eng The Chinese University of Hong Kong Hong Kong Dept. of Comp. Sci. and Soft. Eng University of Melbourne Australia

ISBN: (纸本)3540202021

In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. the result is guaranteed to be complete and correct, and achieve domain consistency. the constructive disjunction propagator for the box constraint collection can be efficiently implemented using indexicals. We give correctness and completeness result for our compilation scheme, and outline optimization techniques. Experiments show that our representation is simple, compact, and propagates efficiently. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint propagation for soft constraints: Generalization and termination conditions 6th

引用

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

作者： Bistarelli, S. Gennari, R. Rossi, F. Università di Pisa Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)3540410538

Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. this framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：