咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
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... 详细信息
来源: 评论
the Confidence constraint: A Step Towards Stochastic cp Solvers  26th
The Confidence Constraint: A Step Towards Stochastic CP Solv...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Mercier-Aubin, Alexandre Dumetz, Ludwig Gaudreault, Jonathan Quimper, Claude-Guy Université Laval G1V 0A6 QuébecQC Canada
We introduce the Confidence constraint, a chance constraint that ensures, with probability, that a set of variables are no smaller than random variables for which the probability distribution is given. this constraint... 详细信息
来源: 评论
the Argmax constraint  26th
The Argmax Constraint
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Gange, Graeme Stuckey, Peter J. Monash University Melbourne Australia
the argmax function returns the index of the (first copy of the) maximum value occuring in a list of values. argmax is important in models where we choose a characteristic value based on a seperate criteria, and for m... 详细信息
来源: 评论
Strengthening Neighbourhood Substitution  26th
Strengthening Neighbourhood Substitution
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Cooper, Martin C. ANITI IRIT University of Toulouse III Toulouse France
Domain reduction is an essential tool for solving the constraint satisfaction problem (CSP). In the binary CSP, neighbourhood substitution consists in eliminating a value if there exists another value which can be sub... 详细信息
来源: 评论
Leveraging Reinforcement Learning, constraint programming and Local Search: A Case Study in Car Manufacturing  26th
Leveraging Reinforcement Learning, Constraint Programming an...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Antuori, Valentin Hebrard, Emmanuel Huguet, Marie-José Essodaigui, Siham Nguyen, Alain LAAS-CNRS Université de Toulouse CNRS INSA Toulouse France Renault Boulogne-Billancourt France ANITI Université de Toulouse Toulouse France
the problem of transporting vehicle components in a car manufacturer workshop can be seen as a large scale single vehicle pickup and delivery problem with periodic time windows. Our experimental evaluation indicates t... 详细信息
来源: 评论
Dashed Strings and the Replace(-all) constraint  26th
Dashed Strings and the Replace(-all) Constraint
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Amadini, Roberto Gange, Graeme Stuckey, Peter J. University of Bologna Bologna Italy Monash University MelbourneVIC Australia
Dashed strings are a formalism for modelling the domain of string variables when solving combinatorial problems with string constraints. In this work we focus on (variants of) the Replace constraint, which aims to fin... 详细信息
来源: 评论
abstractXOR: A global constraint dedicated to differential cryptanalysis  26th
abstractXOR: A global constraint dedicated to differential c...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Rouquette, Loïc Solnon, Christine CITI INRIA INSA Lyon Villeurbanne69621 France LIRIS UMR5201 CNRS Villeurbanne69621 France
constraint programming models have been recently proposed to solve cryptanalysis problems for symmetric block ciphers such as AES. these models are more efficient than dedicated approaches but their design is difficul... 详细信息
来源: 评论
principles and practice of constraint programming--cp98 : 4th international conference, cp98, Pisa, Italy, October 26-30, 1998 : Proceedings
收藏 引用
2016年
作者: michael maher
principles and practice of constraint programming--cp98 : 4th international conference, cp98, Pisa, Italy, October 26-30, 1998 : Proceedings by cp98 (1998 : Pisa, Italy); Maher, Michael, 1959-; Puget, Jean-Francois; p... 详细信息
来源: 评论
Bounding Linear Programs by constraint Propagation: Application to Max-SAT  26th
Bounding Linear Programs by Constraint Propagation: Applicat...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic
the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this tech... 详细信息
来源: 评论
On Relation Between constraint Propagation and Block-Coordinate Descent in Linear Programs  26th
On Relation Between Constraint Propagation and Block-Coordin...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic
Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally ... 详细信息
来源: 评论