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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

309 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

322 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

274 篇 工学
- 267 篇 计算机科学与技术...
- 165 篇 软件工程
- 27 篇 信息与通信工程
- 19 篇 电气工程
- 4 篇 化学工程与技术
- 3 篇 动力工程及工程热...
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
192 篇 理学
- 143 篇 数学
- 116 篇 系统科学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 化学
- 3 篇 生物学
- 1 篇 地球物理学
24 篇 管理学
- 22 篇 管理科学与工程(可...
- 15 篇 工商管理
- 3 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

64 篇 constraint theor...
52 篇 constraint satis...
31 篇 constraint progr...
11 篇 constrained opti...
8 篇 problem solving
7 篇 scheduling
6 篇 mathematical log...
5 篇 artificial intel...
4 篇 modeling languag...
4 篇 model checking
4 篇 optimization
4 篇 programming lang...
4 篇 logics and meani...
3 篇 polynomial appro...
3 篇 constraint handl...
3 篇 semantics
3 篇 algorithm analys...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 software enginee...

机构

5 篇 cork constraint ...
5 篇 cork constraint ...
4 篇 ecole polytech m...
4 篇 fraunhofer first...
4 篇 natl univ irelan...
4 篇 kth royal inst t...
4 篇 mines de nantes
4 篇 brown univ provi...
3 篇 univ bologna dei...
3 篇 nicta nsw
3 篇 university of co...
3 篇 161 rue ada mont...
3 篇 iiia-csic campus...
3 篇 univ connecticut...
3 篇 natl univ irelan...
3 篇 univ coll cork c...
3 篇 univ london impe...
3 篇 univ toronto dep...
2 篇 lund university ...
2 篇 university of pa...

作者

16 篇 stuckey peter j.
11 篇 o'sullivan barry
9 篇 bessiere christi...
8 篇 miguel ian
8 篇 beldiceanu nicol...
8 篇 hebrard emmanuel
8 篇 pesant gilles
7 篇 van hentenryck p...
7 篇 walsh toby
7 篇 schulte christia...
7 篇 quimper claude-g...
6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 choueiry berthe ...
6 篇 simonis helmut
6 篇 schaus pierre
5 篇 rousseau louis-m...
5 篇 hnich brahim
5 篇 deville yves
5 篇 bessière christi...

语言

322 篇 英文
1 篇 中文

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

共 323 条记录，以下是131-140 订阅

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

详细简洁

排序：

Decomposing global GRAMMAR constraints

Decomposing global GRAMMAR constraints

引用

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

作者： Quimper, Claude-Guy Walsh, Toby Omega Omptimization NICTA UNSW

ISBN: (纸本)9783540749691

A wide range of constraints can be specified using automata or formal languages. the GRAMMAR constraint restricts the values taken by a sequence of variables to be a string from a given context-free language. Based on an AND/OR decomposition, we show that this constraint can be converted into clauses in conjunctive normal form without hindering propagation. Using this decomposition, we can propagate the GRAMMAR constraint in O(n(3)) time. the decomposition also provides an efficient incremental propagator. Down a branch of the search tree of length k, we can enforce GAC k times in the same O(n(3)) time. On specialized languages, running time can be even better. For example, propagation of the decomposition requires just O(n|delta|) time for regular languages where |delta| is the size of the transition table of the automaton recognizing the regular language. Experiments on a shift scheduling problem with a constraint solver and a state of the art SAT solver show that we can solve problems using this decomposition that defeat existing constraint solvers.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Structure-Driven Multiple constraint Acquisition 25th

Structure-Driven Multiple Constraint Acquisition

引用

25th international conference on the principles and practice of constraint programming (cp)

作者： Tsouros, Dimosthenis C. Stergiou, Kostas Bessiere, Christian Univ Western Macedonia Dept Informat & Telecommun Engn Kozani Greece Univ Montpellier CNRS Montpellier France

ISBN: (纸本)9783030300487

MQuAcq is an algorithm for active constraint acquisition that has been shown to outperform previous algorithms such as QuAcq and MultiAcq. In this paper, we exhibit two important drawbacks of MQuAcq. First, for each negative example, the number of recursive calls to the main procedure of MQuAcq can be non-linear, making it impractical for large problems. Second, MQuAcq, as well as QuAcq and MultiAcq, does not take into account the structure of the learned problem. We propose MQuAcq-2, a new algorithm based on MQuAcq that integrates solutions to both these problems. MQuAcq-2 exploits the structure of the learned problem by focusing the queries it generates to quasi-cliques of constraints. When dealing with a negative query, it only requires a linear number of iterations. MQuAcq-2 outperforms MQuAcq, especially on large problems.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Deployment of Mobile Wireless Sensor Networks for Crisis Management: A constraint-Based Local Search Approach

Deployment of Mobile Wireless Sensor Networks for Crisis Man...

引用

20th international conference on the principles and practice of constraint programming (cp)

作者： Pralet, Cedric Lesire, Charles Off Natl Etud & Rech Aerosp French Aerosp Lab F-31055 Toulouse France

ISBN: (纸本)9783319104287;9783319104270

In this paper, we consider a problem of management of crisis situations (incidents on nuclear or chemical plants, natural disasters...) that require remote sensing, using a set of ground and aerial robots. In this problem, sensed data must be transmitted in real-time to an operation center even in case of unavailability of traditional communication infrastructures. this implies that an ad hoc wireless communication network must be deployed, for instance using a fleet of UAVs acting as communication relays. From a technical point of view, we tackle a scheduling problem in which activities of mobile sensing robots and mobile relays must be synchronized both in time and space. Schedules produced must also be flexible and robust to the uncertainty about the duration of robot moves at execution time. the problem is modeled and solved using constraint-based local search, with some calls to graph algorithms that help defining good communication networks.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Beyond Consistency and Substitutability

Beyond Consistency and Substitutability

引用

20th international conference on the principles and practice of constraint programming (cp)

作者： Cooper, Martin C. Univ Toulouse 3 IRIT F-31062 Toulouse France

ISBN: (纸本)9783319104287;9783319104270

Elimination of inconsistent values in instances of the constraint satisfaction problem (CSP) conserves all solutions. Elimination of substitutable values conserves at least one solution. We show that certain values which are neither inconsistent nor substitutable can also be deleted while conserving at least one solution. this allows us to state novel rules for the elimination of values in a binary CSP. From a practical point of view, we show that one such rule can be applied in the same asymptotic time complexity as neighbourhood substitution but is strictly stronger. An alternative to the elimination of values from domains is the elimination of variables. We give novel satisfiability-preserving variable elimination operations. In each case we show that if the instance is satisfiable, then a solution to the original instance can always be recovered in low-order polynomial time from a solution to the reduced instance.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Distributed constraint satisfaction as a computational model of negotiation via argumentation 7

引用

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

作者： Jung, Hyuckchul Dept. of Computer Science University of Southern California Henri Salvatori Computer Center Los AngelesCA90089-0781 United States

ISBN: (纸本)3540428631

Distributed and collaborative agents are promising to play an important role in largescale multi-agent applications where such collaborative agents may enter into conflicts over their shared resources. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is a promising approach to collaborative conflict resolution[1]. While previous implemented argumentation systems have performed well in small-size applications, no systematic investigation in large scale has been done. thus, several questions about computational performance of argumentation remain unaddressed; such as understanding if (and when) argumentation actually speeds up conflict resolution convergence and formulating different collaborative NVA strategies to understand their impact on convergence. Answering these questions requires an abstract, well-understood computational model of argumentation, suitable for large-scale experimental investigations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A dynamic distributed constraint satisfaction approach to resource allocation 7

引用

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

作者： Modi, Pragnesh Jay Jung, Hyuckchul Tambe, Milind Shen, Wei-Min Kulkarni, Shriniwas University of Southern California Information Sciences Institute 4676 Admiralty Way Marina del ReyCA90292 United States

ISBN: (纸本)3540428631

In distributed resource allocation a set of agents must assign their resources to a set of tasks. this problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general solution strategy are missing. this paper takes a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem and a general solution strategy that uses distributed constraint satisfaction techniques. this paper defines the notion of Dynamic Distributed constraint Satisfaction Problem (DyDCSP) and proposes two generalized mappings from distributed resource allocation to DyDCSP, each proven to correctly perform resource allocation problems of specific difficulty and this theoretical result is verified in practice by an implementation on a real-world distributed sensor network. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Solution-Based Phase Saving for cp: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers 1

引用

24th international conference on the principles and practice of constraint programming (cp)

作者： Demirovic, Emir Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Sch Comp & Informat Syst Melbourne Vic Australia

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

Large neighbourhood search, a meta-heuristic, has proven to be successful on a wide range of optimisation problems. the algorithm repeatedly generates and searches through a neighbourhood around the current best solution. thus, it finds increasingly better solutions by solving a series of simplified problems, all of which are related to the current best solution. In this paper, we show that significant benefits can be obtained by simulating local-search behaviour in constraint programming by using phase saving based on the best solution found so far during the search, activity-based search (VSIDS), and nogood learning. the approach is highly effective despite its simplicity, improving the highest scoring solver, Chuffed, in the free category of the MiniZinc Challenge 2017, and can be easily integrated into modern constraint programming solvers. We validated the results on a wide range of benchmarks from the competition library, comparing against seventeen state-of-the-art solvers.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

On Decomposing Knapsack constraints for Length-Lex Bounds Consistency

On Decomposing Knapsack Constraints for Length-Lex Bounds Co...

引用

15th international conference on principles and practice of constraint programming (cp 2009)

作者： Sellmann, Meinolf Brown Univ Dept Comp Sci Providence RI 02912 USA

ISBN: (纸本)9783642042430

the length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency for Knapsack constraints it has been proposed to decompose the constraint into two sum constraints. We provide theoretical and practical evidence which shows that decomposition increases the problem of computing a fixpoint which is intrinsic to the length-lex representation: 1. the fixpoint problem for this domain representation is NP-hard in general. 2. For a tractable sub-family of Knapsack decomposition takes more time than exponential brute-force enumeration. 3. Experimental results on decomposed Knapsack constraints show that exponential-time fixpoint computation is the rule and not some pathological exception.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Hybrid constraint Model for the Routing and Wavelength Assignment Problem

A Hybrid Constraint Model for the Routing and Wavelength Ass...

引用

15th international conference on principles and practice of constraint programming (cp 2009)

作者： Simonis, Helmut Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland

ISBN: (纸本)9783642042430

In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing and optimization aspect, combined with a finite domain constraint model for the wavelength assignment. If a solution to the constraint problem is found, it provides an optimal Solution to the overall problem. If the constraint problem is infeasible, we use an extended explanation technique to find a good relaxation of the problem which leads to a near optimal solution. Extensive experiments show that proven optimality is achieved for more than 99.8% of all cases tested, while run-times are orders of magnitude smaller than the best known MIP solution.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

Interpreting sloppy stick figures with constraint-based subgraph matching 7

引用

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

作者： Fromherz, Markus P. J. Mahoney, James V. Xerox PARC 3333 Coyote Hill Road Palo AltoCA94304 United States

ISBN: (纸本)3540428631

Machine systems for understanding hand-drawn sketches must reliably interpret common but sloppy curvilinear configurations. the task is commonly expressed as finding an image model in the image data, but few approaches exist for recognizing drawings with missing model parts and noisy data. In this paper, we propose a two-stage structural modeling approach that combines computer vision techniques with constraint-based recognition. the first stage produces a data graph through standard image analysis techniques augmented by rectification operations that account for common forms of drawing variability and noise. the second stage combines CLP(FD) with concurrent constraint programming for efficient and optimal matching of attributed model and data graphs. this approach offers considerable ease in stating model constraints and objectives, and also leads to an efficient algorithm that scales well with increasing image complexity. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：