咨询与建议

限定检索结果

文献类型

  • 1,005 篇 会议
  • 51 篇 期刊文献
  • 20 册 图书

馆藏范围

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

日期分布

学科分类号

  • 900 篇 工学
    • 876 篇 计算机科学与技术...
    • 526 篇 软件工程
    • 45 篇 信息与通信工程
    • 29 篇 电气工程
    • 22 篇 控制科学与工程
    • 10 篇 机械工程
    • 6 篇 建筑学
    • 6 篇 土木工程
    • 5 篇 力学(可授工学、理...
    • 5 篇 材料科学与工程(可...
    • 5 篇 化学工程与技术
    • 5 篇 交通运输工程
    • 5 篇 农业工程
    • 5 篇 生物工程
    • 4 篇 动力工程及工程热...
    • 3 篇 航空宇航科学与技...
    • 3 篇 环境科学与工程(可...
  • 551 篇 理学
    • 436 篇 数学
    • 283 篇 系统科学
    • 19 篇 统计学(可授理学、...
    • 11 篇 物理学
    • 8 篇 生物学
    • 5 篇 化学
  • 84 篇 管理学
    • 69 篇 管理科学与工程(可...
    • 44 篇 工商管理
    • 18 篇 图书情报与档案管...
  • 9 篇 法学
    • 9 篇 社会学
  • 7 篇 经济学
    • 7 篇 应用经济学
  • 5 篇 农学
    • 5 篇 作物学
  • 2 篇 教育学
    • 2 篇 教育学
  • 1 篇 军事学

主题

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

机构

  • 19 篇 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 篇 161 rue ada mont...
  • 6 篇 natl univ singap...
  • 6 篇 univ st andrews ...
  • 6 篇 cork constraint ...
  • 6 篇 chinese univ hon...
  • 5 篇 cornell univ dep...
  • 5 篇 univ coll cork d...
  • 5 篇 ben gurion univ ...
  • 5 篇 brown univ dept ...
  • 5 篇 department of co...

作者

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

语言

  • 1,073 篇 英文
  • 3 篇 中文
检索条件"任意字段=9th International Conference on Principles and Practice of Constraint Programming"
1076 条 记 录,以下是271-280 订阅
排序:
Higher-Order Consistencies through GAC on Factor Variables
Higher-Order Consistencies through GAC on Factor Variables
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Likitvivatanavong, Chavalit Xia, Wei Yap, Roland H. C. Natl Univ Singapore Sch Comp Singapore 117548 Singapore
Filtering constraint networks to reduce search space is one of the main cornerstones of constraint programming and among them (Generalized) Arc Consistency has been the most fundamental. While stronger consistencies a... 详细信息
来源: 评论
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers
Sequential Time Splitting and Bounds Communication for a Por...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Amadini, Roberto Stuckey, Peter J. Univ Bologna Dept Comp Sci & Engn Lab Focus INRIA I-40126 Bologna Italy Univ Melbourne Dept Informat Syst & Comp Melbourne Vic 3010 Australia
Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for ... 详细信息
来源: 评论
Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning
Improving Relational Consistency Algorithms Using Dynamic Re...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Schneider, Anthony Woodward, Robert J. Choueiry, Berthe Y. Bessiere, Christian Univ Nebraska Constraint Syst Lab Lincoln NE 68588 USA CNRS LIRMM Montpellier France Univ Montpellier Montpellier France
Relational consistency algorithms are instrumental for solving difficult instances of constraint Satisfaction Problems (CSPs), often allowing backtrack-free search. In this paper, we improve an algorithm for enforcing... 详细信息
来源: 评论
Reformulation Based MaxSAT Robustness
Reformulation Based MaxSAT Robustness
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Bofill, Miquel Busquets, Didac Villaret, Mateu Univ Girona Dept Informat Matemat Aplicada & Estadist Girona Spain Imperial Coll London Dept Elect & Elect Engn London England
the presence of uncertainty in the real world makes robustness a desirable property of solutions to constraint Satisfaction Problems (CSP). A solution is said to be robust if it can be easily repaired when unexpected ... 详细信息
来源: 评论
Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector
Experimental Comparison of BTD and Intelligent Backtracking:...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Blet, Loic Ndiaye, Samba Ndojh Solnon, Christine Univ Lyon LIRIS UMR5205 Lyon France
We consider a generic binary CSP solver parameterized by high-level design choices, i.e., backtracking mechanisms, constraint propagation levels, and variable ordering heuristics. We experimentally compare 24 differen... 详细信息
来源: 评论
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
Reducing the Branching in a Branch and Bound Algorithm for t...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: McCreesh, Ciaran Prosser, Patrick Univ Glasgow Glasgow Lanark Scotland
Finding the largest clique in a given graph is one of the fundamental NP-hard problems. We take a widely used branch and bound algorithm for the maximum clique problem, and discuss an alternative way of understanding ... 详细信息
来源: 评论
Nested constraint Programs
Nested Constraint Programs
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Natl ICT Australia Dept Comp & Informat Syst Victoria Lab Melbourne Vic 3010 Australia
Many real world discrete optimization problems are expressible as nested problems where we solve one optimization or satisfaction problem as a subproblem of a larger meta problem. Nested problems include many importan... 详细信息
来源: 评论
Insights into Parallelism with Intensive Knowledge Sharing
Insights into Parallelism with Intensive Knowledge Sharing
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Sabharwal, Ashish Samulowitz, Horst Allen Inst Artificial Intelligence AI2 Seattle WA 98103 USA IBM Watson Res Ctr Yorktown Hts NY 10598 USA
Novel search space splitting techniques have recently been successfully exploited to paralleliz constraint programming and Mixed Integer programming solvers. We first show how universal hashing can be used to extend o... 详细信息
来源: 评论
View-Based Propagator Derivation
View-Based Propagator Derivation
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Schulte, Christian Tack, Guido KTH Royal Inst Technol SCALE Stockholm Sweden Monash Univ NICTA Melbourne Vic Australia
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constrai... 详细信息
来源: 评论
Beyond Consistency and Substitutability
Beyond Consistency and Substitutability
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Cooper, Martin C. Univ Toulouse 3 IRIT F-31062 Toulouse France
Elimination of inconsistent values in instances of the constraint satisfaction problem (CSP) conserves all solutions. Elimination of substitutable values conserves at least one solution. We show that certain values wh... 详细信息
来源: 评论