咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是321-330 订阅
排序:
Automated Symmetry Breaking and Model Selection in CONJURE
Automated Symmetry Breaking and Model Selection in CONJURE
收藏 引用
19th Annual international conference on principles and practice of constraint programming (CP)
作者: Akgun, Ozgur Frisch, Alan M. Gent, Ian P. Hussain, Bilal Syed Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland Univ York York YO10 5DD N Yorkshire England Cork Constraint Computat Ctr Cork Ireland
constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. the CONJURE automated constraint modelling system addresses this problem by automatically refining... 详细信息
来源: 评论
Atom Mapping with constraint programming
Atom Mapping with Constraint Programming
收藏 引用
19th Annual international conference on principles and practice of constraint programming (CP)
作者: Mann, Martin Nahar, Feras Ekker, Heinz Backofen, Rolf Stadler, Peter F. Flamm, Christoph Univ Freiburg Dept Comp Sci Bioinformat George Kohler Allee 106 D-79106 Freiburg Germany Univ Freiburg BIOSS D-79001 Freiburg Germany Univ Freiburg ZBSA D-79001 Freiburg Germany Univ Copenhagen Ctr Noncoding RNA Technol & Hlth DK-1168 Copenhagen Denmark Univ Vienna Inst Theoret Chem A-1090 Vienna Austria Univ Leipzig Interdisciplinary Ctr Bioinformat Dept Comp Sci Bioinformat Grp D-04107 Leipzig Germany Max Planck Inst Math Sci D-04103 Leipzig Germany Fraunhofer Inst Cell Therapy & Immunol D-04103 Leipzig Germany Santa Fe Inst Santa Fe NM 87501 USA
Chemical reactions consist of a rearrangement of bonds so that each atom in an educt molecule appears again in a specific position of a reaction product. In general this bijection between educt and product atoms is no... 详细信息
来源: 评论
To Encode or to Propagate? the Best Choice for Each constraint in SAT
To Encode or to Propagate? The Best Choice for Each Constrai...
收藏 引用
19th Annual international conference on principles and practice of constraint programming (CP)
作者: Abio, Ignasi Nieuwenhuis, Robert Oliveras, Albert Rodriguez-Carbonell, Enric Stuckey, Peter J. Tech Univ Dresden Theoret Comp Sci Dresden Germany Tech Univ Catalonia Barcelona Spain Natl ICT Australia Sydney NSW Australia Univ Melbourne Melbourne Vic 3010 Australia
Sophisticated compact SAT encodings exist for many types of constraints. Alternatively, for instances with many (or large) constraints, the SAT solver can also be extended with built-in propagators (the SAT Modulo the... 详细信息
来源: 评论
Maintaining Soft Arc Consistencies in BnB-ADOPT+ during Search
Maintaining Soft Arc Consistencies in BnB-ADOPT<SUP>+</SUP> ...
收藏 引用
19th Annual international conference on principles and practice of constraint programming (CP)
作者: Gutierrez, Patricia Lee, Jimmy H. M. Lei, Ka Man Mak, Terrence W. K. Meseguer, Pedro Univ Autonoma Barcelona IIIA CSIC Bellaterra 08193 Spain Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Peoples R China NICTA Victoria Lab Melbourne Vic 3010 Australia Univ Melbourne Melbourne Vic 3010 Australia
Gutierrez and Meseguer show how to enforce consistency in BnB-ADOPT(+) for distributed constraint optimization, but they consider unconditional deletions only. However, during search, more values can be pruned conditi... 详细信息
来源: 评论
Dead-End Elimination for Weighted CSP
Dead-End Elimination for Weighted CSP
收藏 引用
19th Annual international conference on principles and practice of constraint programming (CP)
作者: de Givry, Simon Prestwich, Steven D. O'Sullivan, Barry INRA UR 875 MIA T F-31320 Castanet Tolosan France Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland
Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and prune dominated solutions in combinatorial optimization. Recently, it has been shown in [26] that enforcing partial SNS (PSN... 详细信息
来源: 评论
Solving the agricultural land allocation problem by constraint-based local search
Solving the agricultural land allocation problem by constrai...
收藏 引用
19th international conference on principles and practice of constraint programming, CP 2013
作者: Bui, Quoc Trung Pham, Quang Dung Deville, Yves ICTEAM Université Catholique de Louvain Belgium SoICT Hanoi University of Science and Technology Viet Nam
Agricultural land allocation is a problem that exists in most provinces in Vietnam. Each household owns many disconnected parcels, which reduces agricultural development. the solution to the problem is to repartition ... 详细信息
来源: 评论
constraints in Software Testing, Verification and Analysis CSTVA 2013
Constraints in Software Testing, Verification and Analysis C...
收藏 引用
6th IEEE international conference on Software Testing, Verification and Validation (ICST)
作者: Cadar, Cristian Dadeau, Frederic Univ London Imperial Coll Sci Technol & Med South Kensington Campus London SW7 2AZ England INRIA CASSIS FEMTO ST Inst F-25030 Besancon France
Recent years have seen an increasing interest in the application of constraint solving techniques to test, verify and analyze software systems. A significant body of constraint-based techniques has been proposed and i... 详细信息
来源: 评论
Tractable combinations of global constraints
Tractable combinations of global constraints
收藏 引用
19th international conference on principles and practice of constraint programming, CP 2013
作者: Cohen, David A. Jeavons, Peter G. thorstensen, Evgenij Živný, Stanislav Department of Computer Science Royal Holloway University of London United Kingdom Department of Computer Science University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints... 详细信息
来源: 评论
Improving WPM2 for (weighted) partial MaxSAT
Improving WPM2 for (weighted) partial MaxSAT
收藏 引用
19th international conference on principles and practice of constraint programming, CP 2013
作者: Ansótegui, Carlos Bonet, Maria Luisa Gabàs, Joel Levy, Jordi DIEI Univ. de Lleida Spain LSI UPC Spain IIIA-CSIC Spain
Weighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2... 详细信息
来源: 评论
Globalizing constraint models
Globalizing constraint models
收藏 引用
19th international conference on principles and practice of constraint programming, CP 2013
作者: Leo, Kevin Mears, Christopher Tack, Guido Garcia De La Banda, Maria Faculty of IT Monash University Australia Victoria Laboratory Australia
We present a method that, given a constraint model, suggests global constraints to replace parts of it. this helps non-expert users to write higher-level models that are easier to reason about and may result in better... 详细信息
来源: 评论