咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
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
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 ... 详细信息
来源: 评论
Understanding How People Approach constraint Modelling and Solving  28
Understanding How People Approach Constraint Modelling and S...
收藏 引用
28th international conference on principles and practice of constraint programming, cp 2022
作者: Hoffmann, Ruth Zhu, Xu Akgün, Özgür Nacenta, Miguel A. School of Computer Science University of St Andrews United Kingdom Department of Computer Science University of Victoria Canada
Research in constraint programming typically focuses on problem solving efficiency. However, the way users conceptualise problems and communicate with constraint programming tools is often sidelined. How humans think ... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论
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
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 be... 详细信息
来源: 评论
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
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 repo... 详细信息
来源: 评论
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
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 produ... 详细信息
来源: 评论
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
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 algorit... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论
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
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 m... 详细信息
来源: 评论
Fixed-Template Promise Model Checking Problems  28
Fixed-Template Promise Model Checking Problems
收藏 引用
28th international conference on principles and practice of constraint programming, cp 2022
作者: Asimi, Kristina Barto, Libor Butti, Silvia Department of Algebra Faculty of Mathematics and Physics Charles University Prague Czech Republic Department of Information and Communication Technologies Universitat Pompeu Fabra Barcelona Spain
the fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a clas... 详细信息
来源: 评论