咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
Omissions in constraint Acquisition  26th
Omissions in Constraint Acquisition
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Tsouros, Dimosthenis C. Stergiou, Kostas Bessiere, Christian Department of Electrical and Computer Engineering University of Western Macedonia Kozani Greece CNRS University of Montpellier Montpellier France
Interactive constraint acquisition is a special case of query-directed learning, also known as "exact" learning. It is used to assist non-expert users in modeling a constraint problem automatically by postin... 详细信息
来源: 评论
Distributed constraint-based local search
Distributed constraint-based local search
收藏 引用
12th international conference on principles and practice of constraint programming (cp 2006)
作者: Michel, Laurent See, Andrew Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed but instead a doubling of the number ... 详细信息
来源: 评论
A Circuit constraint for Multiple Tours Problems  1
收藏 引用
24th international conference on the principles and practice of constraint programming (cp)
作者: Vismara, Philippe Briot, Nicolas Univ Montpellier CNRS LIRMM Montpellier France Univ Montpellier INRA Montpellier SupAgro MISTEA Montpellier France
Routing problems appear in many practical applications. In the context of constraint programming, circuit constraints have been successfully developed to handle problems like the well-known Traveling Salesman Problem ... 详细信息
来源: 评论
Breaking Symmetries with RootClique and LexTopSort  26th
Breaking Symmetries with RootClique and LexTopSort
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Fichte, Johannes K. Hecher, Markus Szeider, Stefan School of Engineering Sciences TU Dresden Dresden Germany Database and Artificial Intelligence Group TU Wien Vienna Austria Algorithms and Complexity Group TU Wien Vienna Austria
Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and ... 详细信息
来源: 评论
Watched Propagation of$$0$$ -$$1$$ Integer Linear constraints  26th
Watched Propagation of$$0$$ -$$1$$ Integer Linear Constraint...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Devriendt, Jo Lund University Lund Sweden University of Copenhagen Copenhagen Denmark
Efficient unit propagation for clausal constraints is a core building block of conflict-driven clause learning (CDCL) Boolean satisfiability (SAT) and lazy clause generation constraint programming (cp) solvers. Confli... 详细信息
来源: 评论
theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models  26th
Theoretical and Experimental Results for Planning with Learn...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Say, Buser Devriendt, Jo Nordström, Jakob Stuckey, Peter J. Monash University Melbourne Australia Lund University Lund Sweden University of Copenhagen Copenhagen Denmark
We study planning problems where the transition function is described by a learned binarized neural network (BNN). theoretically, we show that feasible planning with a learned BNN model is NP-complete, and present two... 详细信息
来源: 评论
HADDOCK: A Language and Architecture for Decision Diagram Compilation  26th
HADDOCK: A Language and Architecture for Decision Diagram C...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Gentzel, Rebecca Michel, Laurent van Hoeve, W.-J. University of Connecticut StorrsCT06269 United States Carnegie Mellon University PittsburghPA15213 United States
Multi-valued decision diagrams (MDDs) were introduced into constraint programming over a decade ago as a powerful alternative to domain propagation. While effective MDD-propagation algorithms have been proposed for va... 详细信息
来源: 评论
Solving Satisfaction Problems Using Large-Neighbourhood Search  26th
Solving Satisfaction Problems Using Large-Neighbourhood Sear...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Björdal, Gustav Flener, Pierre Pearson, Justin Stuckey, Peter J. Tack, Guido Department of Information Technology Uppsala University Uppsala Sweden Faculty of Information Technology Monash University Melbourne Australia
Large-neighbourhood search (LNS) improves an initial solution, hence it is not directly applicable to satisfaction problems. In order to use LNS in a constraint programming (cp) framework to solve satisfaction problem... 详细信息
来源: 评论
Using constraint programming to Generate Benzenoid Structures in theoretical Chemistry  26th
Using Constraint Programming to Generate Benzenoid Structure...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Carissan, Yannick Hagebaum-Reignier, Denis Prcovic, Nicolas Terrioux, Cyril Varet, Adrien Aix Marseille Univ CNRS Centrale Marseille ISM2 Marseille France Aix Marseille Univ Université de Toulon CNRS LIS Marseille France
Benzenoids are a subfamily of hydrocarbons (molecules that are only made of hydrogen and carbon atoms) whose carbon atoms form hexagons. these molecules are widely studied in theoretical chemistry and have a lot of co... 详细信息
来源: 评论
Quantum-Accelerated Global constraint Filtering  26th
Quantum-Accelerated Global Constraint Filtering
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Booth, Kyle E. C. O’Gorman, Bryan Marshall, Jeffrey Hadfield, Stuart Rieffel, Eleanor NASA Ames Research Center Moffett Field CA94035 United States Mountain ViewCA94043 United States University of California BerkeleyCA94720 United States
Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in qu... 详细信息
来源: 评论