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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

49 篇 会议
2 册 图书

馆藏范围

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

日期分布

学科分类号

43 篇 工学
- 43 篇 计算机科学与技术...
- 36 篇 软件工程
- 2 篇 材料科学与工程（可...
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
36 篇 理学
- 26 篇 系统科学
- 21 篇 数学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理
2 篇 法学
- 2 篇 社会学

主题

10 篇 constraint theor...
7 篇 constraint satis...
4 篇 constraint progr...
2 篇 modeling languag...
2 篇 model checking
2 篇 linear programmi...
2 篇 constraint progr...
1 篇 constraint logic...
1 篇 structural prope...
1 篇 international
1 篇 reinforcement le...
1 篇 bounded model ch...
1 篇 probability dist...
1 篇 soft neighborhoo...
1 篇 test case genera...
1 篇 redundancy
1 篇 embedded systems
1 篇 computational ge...
1 篇 iterative method...
1 篇 conference,

机构

2 篇 dtai ku leuven
2 篇 lund university ...
2 篇 university of ed...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 monash universit...
2 篇 faculty of elect...
2 篇 ku leuven
2 篇 university of co...
1 篇 tech univ madrid...
1 篇 computer and aut...
1 篇 university of co...
1 篇 algorithms and c...
1 篇 pontificia univ ...
1 篇 univ pisa pisa
1 篇 visualization la...
1 篇 univ bologna bol...
1 篇 nicta unsw
1 篇 aniti irit unive...
1 篇 cnrs lirmm unive...

作者

4 篇 stuckey peter j.
4 篇 guns tias
3 篇 devriendt jo
2 篇 prcovic nicolas
2 篇 terrioux cyril
2 篇 werner tomáš
2 篇 akgün özgür
2 篇 hagebaum-reignie...
2 篇 michel laurent
2 篇 varet adrien
2 篇 gange graeme
2 篇 walsh toby
2 篇 tsouros dimosthe...
2 篇 dlask tomáš
2 篇 carissan yannick
2 篇 tsouros dimos
1 篇 pearson justin
1 篇 davidson ewan
1 篇 solnon christine
1 篇 briot nicolas

语言

50 篇 英文
1 篇 中文

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

共 51 条记录，以下是41-50 订阅

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

详细简洁

排序：

the Complexity of Symmetry Breaking beyond Lex-Leader 30

The Complexity of Symmetry Breaking beyond Lex-Leader

引用

30th international conference on principles and practice of constraint programming, cp 2024

作者： Anders, Markus Brenner, Sofia Rattan, Gaurav TU Darmstadt Germany University of Twente Enschede Netherlands

ISBN: (纸本)9783959773362

Symmetry breaking is a widely popular approach to enhance solvers in constraint programming, such as those for SAT or MIP. Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lexicographic leader (lex-leader) in each orbit of assignments. Although it is NP-hard to find complete lex-leader SBPs, incomplete lex-leader SBPs are widely used in practice. In this paper, we investigate the complexity of computing complete SBPs, lex-leader or otherwise, for SAT. Our main result proves a natural barrier for efficiently computing SBPs: efficient certification of graph non-isomorphism. Our results explain the difficulty of obtaining short SBPs for important cp problems, such as matrix-models with row-column symmetries and graph generation problems. Our results hold even when SBPs are allowed to introduce additional variables. We show polynomial upper bounds for breaking certain symmetry groups, namely automorphism groups of trees and wreath products of groups with efficient SBPs. © Markus Anders, Sofia Brenner, and Gaurav Rattan.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks 26th

Constraint-Based Software Diversification for Efficient Miti...

引用

26th international conference on principles and practice of constraint programming, cp 2020

作者： Tsoupidi, Rodothea Myrsini Castañeda Lozano, Roberto Baudry, Benoit KTH Royal Institute of Technology Stockholm Sweden University of Edinburgh Edinburgh United Kingdom

ISBN: (纸本)9783030584740

Modern software deployment process produces software that is uniform, and hence vulnerable to large-scale code-reuse attacks. Compiler-based diversification improves the resilience and security of software systems by automatically generating different assembly code versions of a given program. Existing techniques are efficient but do not have a precise control over the quality of the generated code variants. this paper introduces Diversity by Construction (DivCon), a constraint-based compiler approach to software diversification. Unlike previous approaches, DivCon allows users to control and adjust the conflicting goals of diversity and code quality. A key enabler is the use of Large Neighborhood Search (LNS) to generate highly diverse assembly code efficiently. Experiments using two popular compiler benchmark suites confirm that there is a trade-off between quality of each assembly code version and diversity of the entire pool of versions. Our results show that DivCon allows users to trade between these two properties by generating diverse assembly code for a range of quality bounds. In particular, the experiments show that DivCon is able to mitigate code-reuse attacks effectively while delivering near-optimal code (optimality gap). For constraint programming researchers and practitioners, this paper demonstrates that LNS is a valuable technique for finding diverse solutions. For security researchers and software engineers, DivCon extends the scope of compiler-based diversification to performance-critical and resource-constrained applications. © 2020, Springer Nature Switzerland AG.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

On Redundancy in constraint Satisfaction Problems 28

On Redundancy in Constraint Satisfaction Problems

引用

28th international conference on principles and practice of constraint programming, cp 2022

作者： Carbonnel, Clément CNRS LIRMM University of Montpellier France

ISBN: (纸本)9783959772402

A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(nr), but there are notable examples for which this upper bound is far from the best possible. In general, the non-redundancy of constraint languages is poorly understood and little is known beyond the trivial bounds Ω(n) and O(nr). In this paper, we introduce an elementary algebraic framework dedicated to the analysis of the non-redundancy of constraint languages. this framework relates redundancy-preserving reductions between constraint languages to closure operators known as pattern partial polymorphisms, which can be interpreted as generic mechanisms to generate redundant constraints in CSP instances. We illustrate the power of this framework by deriving a simple characterisation of all languages of arity r having non-redundancy Θ(nr). © Clément Carbonnel.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint 7

引用

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

作者： Beldiceanu, Nicolas Carlsson, Mats SICS Lägerhyddsv. 18 UppsalaSE-752 37 Sweden

ISBN: (纸本)3540428631

We first present a generic pruning technique which aggregates several constraints sharing some variables. the method is derived from an idea called sweep which is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied to several families of global constraints. A second advantage is that it does not lead to any memory consumption problem since it only requires temporary memory which can be reclaimed after each invocation of the method. We then specialize this technique to the non-overlapping rectangles constraint, describe several optimizations, and give an empirical evaluation based on six sets of test instances with different characteristics. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

FuSeBMC IA: Interval Analysis and Methods for Test Case Generation (Competition Contribution) 1

引用

26th international conference on Fundamental Approaches to Software Engineering (FASE) Held as Part of the European Joint conferences on theory and practice of Software (ETAPS)

作者： Aldughaim, Mohannad Alshmrany, Kaled M. Gadelha, Mikhail R. de Freitas, Rosiane Cordeiro, Lucas C. Univ Manchester Manchester Lancs England Igalia La Coruna Spain Univ Fed Amazonas Manaus Amazonas Brazil King Saud Univ Riyadh Saudi Arabia Inst Publ Adm Jeddah Saudi Arabia

ISBN: (数字)9783031308260

ISBN: (纸本)9783031308253;9783031308260

the cooperative veriflcation of Bounded Model Checking and Fuzzing has proved to be one of the most effective techniques when testing C programs. FuSeBMC is a test-generation tool that employs BMC and Fuzzing to produce test cases. In Test-Comp 2023, we present an interval approach to FuSeBMC IA, improving the test generator to use interval methods and abstract interpretation (via Frama-C) to strengthen our instrumentation and fuzzing. Here, an abstract interpretation engine instruments the program as follows. It analyzes different program branches, combines the conditions of each branch, and produces a constraint Satisfaction Problem (CSP), which is solved using constraint programming (cp) by interval manipulation techniques called Contractor programming. this process has a set of invariants for each branch, which are introduced back into the program as constraints. Experimental results show improvements in reducing cpU time (37%) and memory (13%), while retaining a high score.

关键词： Automated Test-Case Generation Bounded Model Checking Fuzzing Abstract Interpretation constraint programming Contractors.

来源：评论

学校读者我要写书评

暂无评论

A Two-Phase constraint programming Model for Examination Timetabling at University College Cork 26th

A Two-Phase Constraint Programming Model for Examination Tim...

引用

26th international conference on principles and practice of constraint programming, cp 2020

作者： Genc, Begum O’Sullivan, Barry Confirm Centre for Smart Manufacturing School of Computer Science and Information Technology University College Cork Cork Ireland Insight Centre for Data Analytics School of Computer Science and Information Technology University College Cork Cork Ireland

ISBN: (纸本)9783030584740

Examination timetabling is a widely studied NP-hard problem. An additional challenge to the complexity of the problem are many real-world requirements that can often prevent the relaxation of some constraints. We report on a project focused on automating the examination timetabling process of University College Cork (UCC) to enhance the examination schedules so that they are fairer to student, as well as being less resource intensive to generate from an administrative point of view. We work with a formulation developed in collaboration with the institution and real data that it provided to us. We propose a two-phase constraint programming approach to solving UCC ’s examination timetabling problem. the first phase considers the timing of examinations while the second phase considers their allocation to rooms. Both phases are modelled using bin-packing constraints and, in particular, an interesting variant in which items can be split across multiple bins. this variant is known as bin packing with fragmentable items. We investigate the tightly linked constraints and difficulties in decomposing the centralised model. We provide empirical results using different search strategies, and compare the quality of our solution with the existing UCC schedule. constraint programming allows us to easily modify the model to express additional constraints or remove the pre-existing ones. Our approach generates significantly better timetables for the university, as measured using a variety of real-world quality metrics, than those prepared by their timetabling experts, and in a reasonable timeframe. © 2020, Springer Nature Switzerland AG.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Guided Bottom-Up Interactive constraint Acquisition 29

Guided Bottom-Up Interactive Constraint Acquisition

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Tsouros, Dimosthenis C. Berden, Senne Guns, Tias KU Leuven Belgium

ISBN: (纸本)9783959773003

constraint Acquisition (CA) systems can be used to assist in the modeling of constraint satisfaction problems. In (inter)active CA, the system is given a set of candidate constraints and posts queries to the user with the goal of finding the right constraints among the candidates. Current interactive CA algorithms suffer from at least two major bottlenecks. First, in order to converge, they require a large number of queries to be asked to the user. Second, they cannot handle large sets of candidate constraints, since these lead to large waiting times for the user. For this reason, the user must have fairly precise knowledge about what constraints the system should consider. In this paper, we alleviate these bottlenecks by presenting two novel methods that improve the efficiency of CA. First, we introduce a bottom-up approach named GrowAcq that reduces the maximum waiting time for the user and allows the system to handle much larger sets of candidate constraints. It also reduces the total number of queries for problems in which the target constraint network is not sparse. Second, we propose a probability-based method to guide query generation and show that it can significantly reduce the number of queries required to converge. We also propose a new technique that allows the use of openly accessible cp solvers in query generation, removing the dependency of existing methods on less well-maintained custom solvers that are not publicly available. Experimental results show that our proposed methods outperform state-of-the-art CA methods, reducing the number of queries by up to 60%. Our methods work well even in cases where the set of candidate constraints is 50 times larger than the ones commonly used in the literature. © Dimosthenis C. Tsouros, Senne Berden, and Tias Guns.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Secure distributed constraint satisfaction: Reaching agreement without revealing private information 8th

引用

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

作者： Yokoo, Makoto Suzuki, Koutarou Hirayama, Katsutoshi NTT Communication Science Laboratories NTT Corporation 2-4 Hikaridai Seika-choKyoto619-0237 Japan NTT Information Sharing Platform Laboratories NTT Corporation 1-1 Hikari-no-oka YokosukaKanagawa239-0847 Japan Kobe University of Mercantile Marine 5-1-1 Fukae-minami-machi Higashinada-ku Kobe658-0022 Japan

ISBN: (纸本)3540441204

this paper develops a secure distributed constraint Satisfaction algorithm. A Distributed constraint Satisfaction Problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple agents. A major motivation for solving a DisCSP without gathering all information in one server is the concern about privacy/***, existing DisCSP algorithms leak some information during the search process and privacy/security issues are not dealt with *** newly developed algorithm utilizes a public key encryption *** this algorithm, multiple servers, which receive encrypted information from agents, cooperatively perform a search process that is equivalent to a standard chronological backtracking. this algorithm does not leak any private information, i.e., neither agents nor servers can obtain any additional information on the value assignment of variables that belong to other agents. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Test case generation for object-oriented imperative languages in CLP

Test case generation for object-oriented imperative language...

引用

26th international conference on Logic programming (ICLP)

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid UPM DLSIIS E-28660 Madrid Spain

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that constraint Logic programming (CLP) has a promising application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.

关键词： test case generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：