咨询与建议

限定检索结果

文献类型

  • 309 篇 会议
  • 8 册 图书
  • 6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 274 篇 工学
    • 267 篇 计算机科学与技术...
    • 165 篇 软件工程
    • 27 篇 信息与通信工程
    • 19 篇 电气工程
    • 4 篇 化学工程与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 土木工程
    • 2 篇 机械工程
    • 2 篇 冶金工程
    • 2 篇 控制科学与工程
    • 2 篇 建筑学
    • 2 篇 农业工程
    • 2 篇 环境科学与工程(可...
    • 1 篇 力学(可授工学、理...
    • 1 篇 材料科学与工程(可...
    • 1 篇 测绘科学与技术
    • 1 篇 石油与天然气工程
  • 192 篇 理学
    • 143 篇 数学
    • 116 篇 系统科学
    • 7 篇 统计学(可授理学、...
    • 5 篇 物理学
    • 4 篇 化学
    • 3 篇 生物学
    • 1 篇 地球物理学
  • 24 篇 管理学
    • 22 篇 管理科学与工程(可...
    • 15 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 4 篇 经济学
    • 4 篇 应用经济学
  • 4 篇 法学
    • 4 篇 社会学
  • 2 篇 农学
    • 2 篇 作物学

主题

  • 64 篇 constraint theor...
  • 52 篇 constraint satis...
  • 31 篇 constraint progr...
  • 11 篇 constrained opti...
  • 8 篇 problem solving
  • 7 篇 scheduling
  • 6 篇 mathematical log...
  • 5 篇 artificial intel...
  • 4 篇 modeling languag...
  • 4 篇 model checking
  • 4 篇 optimization
  • 4 篇 programming lang...
  • 4 篇 logics and meani...
  • 3 篇 polynomial appro...
  • 3 篇 constraint handl...
  • 3 篇 semantics
  • 3 篇 algorithm analys...
  • 3 篇 regular constrai...
  • 2 篇 solution countin...
  • 2 篇 software enginee...

机构

  • 5 篇 cork constraint ...
  • 5 篇 cork constraint ...
  • 4 篇 ecole polytech m...
  • 4 篇 fraunhofer first...
  • 4 篇 natl univ irelan...
  • 4 篇 kth royal inst t...
  • 4 篇 mines de nantes
  • 4 篇 brown univ provi...
  • 3 篇 univ bologna dei...
  • 3 篇 nicta nsw
  • 3 篇 university of co...
  • 3 篇 161 rue ada mont...
  • 3 篇 iiia-csic campus...
  • 3 篇 univ connecticut...
  • 3 篇 natl univ irelan...
  • 3 篇 univ coll cork c...
  • 3 篇 univ london impe...
  • 3 篇 univ toronto dep...
  • 2 篇 lund university ...
  • 2 篇 university of pa...

作者

  • 16 篇 stuckey peter j.
  • 11 篇 o'sullivan barry
  • 9 篇 bessiere christi...
  • 8 篇 miguel ian
  • 8 篇 beldiceanu nicol...
  • 8 篇 hebrard emmanuel
  • 8 篇 pesant gilles
  • 7 篇 van hentenryck p...
  • 7 篇 walsh toby
  • 7 篇 schulte christia...
  • 7 篇 quimper claude-g...
  • 6 篇 nightingale pete...
  • 6 篇 gent ian p.
  • 6 篇 choueiry berthe ...
  • 6 篇 simonis helmut
  • 6 篇 schaus pierre
  • 5 篇 rousseau louis-m...
  • 5 篇 hnich brahim
  • 5 篇 deville yves
  • 5 篇 bessière christi...

语言

  • 322 篇 英文
  • 1 篇 中文
检索条件"任意字段=7th International Conference on Principles and Practice of Constraint Programming, CP 2001"
323 条 记 录,以下是281-290 订阅
排序:
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 ... 详细信息
来源: 评论
the weighted average constraint
The weighted average constraint
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Bonfietti, Alessio Lombardi, Michele DEIS University of Bologna Italy
Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or b... 详细信息
来源: 评论
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... 详细信息
来源: 评论
7th international conference on the theory and practice of Natural Computing, TPNC 2018
7th International Conference on the Theory and Practice of N...
收藏 引用
7th international conference on the theory and practice of Natural Computing, TPNC 2018
the proceedings contain 36 papers. the special focus in this conference is on theory and practice of Natural Computing. the topics include: A linear constrained optimization benchmark for probabilistic search algorith...
来源: 评论
constraint propagation for soft constraints: Generalization and termination conditions  6th
收藏 引用
6th international conference on principles and practice of constraint programming, cp2000
作者: Bistarelli, S. Gennari, R. Rossi, F. Università di Pisa Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semi... 详细信息
来源: 评论
A framework for decision-based consistencies
A framework for decision-based consistencies
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Condotta, Jean-François Lecoutre, Christophe CRIL - CNRS UMR 8188 Univ Lille Nord de France Artois LensF-62307 France
Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most ... 详细信息
来源: 评论
A model seeker: Extracting global constraint models from positive examples
A model seeker: Extracting global constraint models from pos...
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. the system is based on the global constraint catalog, providing the library of cons... 详细信息
来源: 评论
Filtering algorithms for discrete cumulative problems with overloads of resource
Filtering algorithms for discrete cumulative problems with o...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France
Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. ... 详细信息
来源: 评论
Pruning rules for constrained optimisation for conditional preferences
Pruning rules for constrained optimisation for conditional p...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Wilson, Nic Trabelsi, Walid Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a cp-net). this involves checking at e... 详细信息
来源: 评论
A characterisation of the complexity of forbidding subproblems in binary max-CSP
A characterisation of the complexity of forbidding subproble...
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Cooper, Martin C. Escamocher, Guillaume Živný, Stanislav IRIT University of Toulouse III 31062 Toulouse France Department of Computer Science University of Oxford OX1 3QD Oxford United Kingdom
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary... 详细信息
来源: 评论