咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是351-360 订阅
排序:
Exploring chemistry using SMT
Exploring chemistry using SMT
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Fagerberg, Rolf Flamm, Christoph Merkle, Daniel Peters, Philipp Department of Mathematics and Computer Science University of Southern Denmark Denmark Institute for Theoretical Chemistry University of Vienna Austria
How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemica... 详细信息
来源: 评论
A constraint programming approach for the traveling purchaser problem
A constraint programming approach for the traveling purchase...
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Cambazard, Hadrien Penz, Bernard G-SCOP Université de Grenoble / Grenoble-INP / UJF-Grenoble 1 / CNRS France
We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraint programming and Lagrangean relaxation. the TPP is a generalization of the Traveling Salesman Problem involved in many real-worl... 详细信息
来源: 评论
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... 详细信息
来源: 评论
An optimal filtering algorithm for table constraints
An optimal filtering algorithm for table constraints
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Mairy, Jean-Baptiste Van Hentenryck, Pascal Deville, Yves ICTEAM Université Catholique de Louvain Belgium Optimization Research Group NICTA University of Melbourne Australia
Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. this paper proposes four efficient value-... 详细信息
来源: 评论
Conflict directed lazy decomposition
Conflict directed lazy decomposition
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Abío, Ignasi Stuckey, Peter J. Barcelona Spain Department of Computing and Information Systems NICTA Victoria Laboratory University of Melbourne Australia
Two competing approaches to handling complex constraints in satisfaction and optimization problems using SAT and LCG/SMT technology are: decompose the complex constraint into a set of clauses;or (theory) propagate the... 详细信息
来源: 评论
Improved bounded max-sum for distributed constraint optimization
Improved bounded max-sum for distributed constraint optimiza...
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Rollon, Emma Larrosa, Javier Departament de Llenguatges I Sistemes Informàtics Universitat Politècnica de Catalunya Spain
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirica... 详细信息
来源: 评论
Towards solver-independent propagators
Towards solver-independent propagators
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Monette, Jean-Noël Flener, Pierre Pearson, Justin Department of Information Technology Uppsala University Uppsala Sweden
We present an extension to indexicals to describe propagators for global constraints. the resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show h... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A hybrid paradigm for adaptive parallel search
A hybrid paradigm for adaptive parallel search
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Yun, Xi Epstein, Susan L. Department of Computer Science Graduate Center City University of New York New York NY 10016 United States Department of Computer Science Hunter College City University of New York New York NY 10065 United States
Parallelization offers the opportunity to accelerate search on constraint satisfaction problems. To parallelize a sequential solver under a popular message passing protocol, the new paradigm described here combines po... 详细信息
来源: 评论
Revisiting neighborhood inverse consistency on binary CSPs
Revisiting neighborhood inverse consistency on binary CSPs
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: Woodward, Robert J. Karakashian, Shant Choueiry, Berthe Y. Bessiere, Christian Constraint Systems Laboratory University of Nebraska-Lincoln United States LIRMM-CNRS University of Montpellier France
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structur... 详细信息
来源: 评论