咨询与建议

限定检索结果

文献类型

  • 956 篇 会议
  • 51 篇 期刊文献
  • 19 册 图书

馆藏范围

  • 1,025 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 853 篇 工学
    • 833 篇 计算机科学与技术...
    • 495 篇 软件工程
    • 41 篇 信息与通信工程
    • 27 篇 电气工程
    • 17 篇 控制科学与工程
    • 8 篇 机械工程
    • 7 篇 土木工程
    • 6 篇 建筑学
    • 6 篇 化学工程与技术
    • 5 篇 材料科学与工程(可...
    • 5 篇 农业工程
    • 4 篇 力学(可授工学、理...
    • 4 篇 交通运输工程
    • 4 篇 生物工程
    • 3 篇 冶金工程
    • 3 篇 动力工程及工程热...
    • 2 篇 电子科学与技术(可...
    • 2 篇 航空宇航科学与技...
  • 530 篇 理学
    • 422 篇 数学
    • 274 篇 系统科学
    • 18 篇 统计学(可授理学、...
    • 10 篇 物理学
    • 7 篇 生物学
    • 6 篇 化学
  • 62 篇 管理学
    • 54 篇 管理科学与工程(可...
    • 34 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 7 篇 法学
    • 7 篇 社会学
  • 5 篇 经济学
    • 5 篇 应用经济学
  • 5 篇 农学
    • 5 篇 作物学
  • 1 篇 教育学
  • 1 篇 医学
  • 1 篇 军事学

主题

  • 198 篇 constraint theor...
  • 163 篇 constraint satis...
  • 62 篇 constraint progr...
  • 26 篇 constrained opti...
  • 25 篇 computer program...
  • 23 篇 integer programm...
  • 21 篇 answer set progr...
  • 15 篇 logic programmin...
  • 15 篇 artificial intel...
  • 15 篇 scheduling
  • 14 篇 mathematical log...
  • 14 篇 dynamic programm...
  • 13 篇 problem solving
  • 12 篇 linear programmi...
  • 11 篇 global constrain...
  • 11 篇 programming lang...
  • 11 篇 logics and meani...
  • 10 篇 modeling languag...
  • 9 篇 constraint satis...
  • 9 篇 combinatorial op...

机构

  • 18 篇 natl univ irelan...
  • 18 篇 brown univ provi...
  • 14 篇 univ connecticut...
  • 14 篇 cork constraint ...
  • 10 篇 cork constraint ...
  • 8 篇 univ oxford comp...
  • 7 篇 natl univ irelan...
  • 7 篇 natl univ irelan...
  • 7 篇 department of me...
  • 6 篇 nicta nsw
  • 6 篇 natl univ singap...
  • 6 篇 cork constraint ...
  • 6 篇 chinese univ hon...
  • 5 篇 161 rue ada mont...
  • 5 篇 cornell univ dep...
  • 5 篇 univ coll cork d...
  • 5 篇 univ st andrews ...
  • 5 篇 ben gurion univ ...
  • 5 篇 department of co...
  • 5 篇 univ coll cork c...

作者

  • 31 篇 stuckey peter j.
  • 28 篇 o'sullivan barry
  • 22 篇 van hentenryck p...
  • 20 篇 freuder eugene c...
  • 17 篇 walsh toby
  • 17 篇 quimper claude-g...
  • 15 篇 miguel ian
  • 15 篇 michel laurent
  • 15 篇 bessiere christi...
  • 14 篇 beldiceanu nicol...
  • 14 篇 schaus pierre
  • 14 篇 schulte christia...
  • 12 篇 smith barbara m.
  • 12 篇 hebrard emmanuel
  • 12 篇 pesant gilles
  • 11 篇 régin jean-charl...
  • 11 篇 beck j. christop...
  • 10 篇 hnich brahim
  • 10 篇 gent ian p.
  • 10 篇 rueher michel

语言

  • 1,023 篇 英文
  • 3 篇 中文
检索条件"任意字段=10th International Conference on the Principles and Practice of Constraint Programming"
1026 条 记 录,以下是941-950 订阅
Containment, equivalence and coreness from CSP to QCSP and beyond
Containment, equivalence and coreness from CSP to QCSP and b...
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Madelaine, Florent Martin, Barnaby Clermont Université Université d'Auvergne Clermont-Ferrand France France School of Engineering and Computing Sciences Durham University Science Laboratories South Road Durham DH1 3LE United Kingdom
the constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP ), correspond naturally to the model checking problem for three increasingly stronger fragments... 详细信息
来源: 评论
Uncertainty in soft constraint problems
收藏 引用
11th international conference on principles and practice of constraint programming - CP 2005
作者: Pini, Maria Silvia Rossi, Francesca University of Padova Italy
Preferences and uncertainty occur in many real-life problems. We are concerned with the coexistence of preference and uncertainty in the same problem. In particular, we consider uncertainty, defined by the theory of p... 详细信息
来源: 评论
Lower bounds for non-binary constraint optimization problems  7
收藏 引用
7th international conference on principles and practice of constraint programming, CP 2001
作者: Meseguer, Pedro Larrosa, Javier Sànchez, Martì IIIA-CSIC Campus UAB Bellaterra08193 Spain Dep. LSI UPC Jordi Girona Salgado 1-3 Barcelona08034 Spain
the necessity of non-binary constraint satisfaction algorithms is increasing because many real problems are inherently non-binary. Considering overconstrained problems (and Partial Forward Checking as the solving algo... 详细信息
来源: 评论
A general scheme for multiple lower bound computation in constraint optimization  7
收藏 引用
7th international conference on principles and practice of constraint programming, CP 2001
作者: Dechter, Rina Kask, Kalev Larrosa, Javier United States Spain
Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of lower bounds to all singleton tuples, since it p... 详细信息
来源: 评论
Arc consistency for soft constraints  6th
收藏 引用
6th international conference on principles and practice of constraint programming, CP2000
作者: Schiex, thomas INRA Toulouse France
Traditionally, local consistency is defined as a relaxation of consistency which can be checked in polynomial time. It is accompanied by a corresponding "filtering" or "enforcing" algorithm that co... 详细信息
来源: 评论
New lower bounds of constraint violations for over-constrained problems  7
收藏 引用
7th international conference on principles and practice of constraint programming, CP 2001
作者: Règin, Jean-Charles Petit, thierry Bessière, Christian Puget, Jean-François ILOG 1681 route des Dolines Valbonne06560 France LIRMM UMR 5506 CNRS 161 rue Ada Montpellier Cedex 534392 France ILOG 9 rue de Verdun BP 85 Gentilly Cedex94253 France
In recent years, many works have been carried out to solve over-constrained problems, and more specifically the Maximal constraint Satisfaction Problem (Max-CSP), where the goal is to minimize the number of constraint... 详细信息
来源: 评论
An efficient algorithm for mining frequent sequence with constraint programming  15th
收藏 引用
15th European conference on Machine Learning and principles and practice of Knowledge Discovery in Databases, ECML PKDD 2016
作者: Aoga, John O. R. Guns, Tias Schaus, Pierre UCLouvain ICTEAM Louvain-la-Neuve Belgium DTAI Research Group KU Leuven Leuven Belgium
the main advantage of constraint programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc.).... 详细信息
来源: 评论
Cardinality reasoning for bin-packing constraint: Application to a tank allocation problem
Cardinality reasoning for bin-packing constraint: Applicatio...
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Schaus, Pierre Régin, Jean-Charles Van Schaeren, Rowan Dullaert, Wout Raa, Birger ICTEAM Université Catholique de Louvain Belgium University of Nice France Antwerp Maritime Academy Belgium VU University Amsterdam University of Antwerp Netherlands University of Gent Belgium
Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality constraint (GCC) available in most of the CP sol... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Domain reduction for the circuit constraint
收藏 引用
11th international conference on principles and practice of constraint programming - CP 2005
作者: Kaya, Latife Genc Hooker, John Carnegie Mellon University Pittsburgh PA 15213 United States
We present an incomplete filtering algorithm for the circuit constraint. the filter removes redundant values by eliminating non-Hamiltonian edges from the associated graph. We prove a necessary condition for an edge t... 详细信息
来源: 评论