咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 1,060 篇 电子文献
  • 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 篇 dynamic programm...
  • 13 篇 problem solving
  • 12 篇 linear programmi...
  • 10 篇 global constrain...
  • 9 篇 modeling languag...
  • 9 篇 constraint satis...
  • 9 篇 combinatorial op...
  • 9 篇 java programming...
  • 7 篇 model checking
  • 7 篇 optimization
  • 7 篇 local search

机构

  • 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,058 篇 英文
  • 3 篇 中文
检索条件"任意字段=9th International Conference on Principles and Practice of Constraint Programming"
1061 条 记 录,以下是161-170 订阅
排序:
Metamorphic Testing of constraint Solvers  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Akgun, Ozgur Gent, Ian P. Jefferson, Christopher Miguel, Ian Nightingale, Peter Univ St Andrews Sch Comp Sci St Andrews Fife Scotland
constraint solvers are complex pieces of software and are notoriously difficult to debug. In large part this is due to the difficulty of pinpointing the source of an error in the vast searches these solvers perform, s... 详细信息
来源: 评论
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Dlala, Imen Ouled Jabbour, Said Raddaoui, Badran Sais, Lakhdar Univ Artois CNRS CRIL F-62307 Lens France Univ Paris Saclay CNRS SAMOVAR Telecom SudParis Evry France Univ Tunis LARODEC Tunis Tunisia
constraint programming (CP) and propositional satisfiability (SAT) based framework for modeling and solving pattern mining tasks has gained a considerable audience in recent years. However, this nice declarative and g... 详细信息
来源: 评论
Efficient Methods for constraint Acquisition  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Tsouros, Dimosthenis C. Stergiou, Kostas Sarigiannidis, Panagiotis G. Univ Western Macedonia Dept Informat & Telecommun Engn Kozani Greece
constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example... 详细信息
来源: 评论
A Complete Tolerant Algebraic Side-Channel Attack for AES with CP  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Liu, Fanghui Cruz, Waldemar Michel, Laurent Univ Connecticut Sch Engn Comp Sci & Engn Dept Storrs CT 06269 USA
Tolerant Algebraic Side-Channel Attack (TASCA) is a combination of algebraic and side-channel analysis with error tolerance. Oren et al., used mathematical programming to implement TASCA over a round-limited version o... 详细信息
来源: 评论
Balancing Asymmetry in Max-sum Using Split constraint Factor Graphs  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Cohen, Liel Zivan, Roie Ben Gurion Univ Negev Beer Sheva Israel
Max-sum is a version of Belief Propagation, used for solving DCOPs. On tree-structured problems, Max-sum converges to the optimal solution in linear time. When the constraint graph representing the problem includes mu... 详细信息
来源: 评论
Quantified Valued constraint Satisfaction Problem  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Madelaine, Florent Secouard, Stephane Univ Paris Est Creteil LACL Creteil France Univ Caen Normandie CNRS GREYC Caen France
We study the complexity of the quantified and valued extension of the constraint satisfaction problem (QVCSP) for certain classes of languages. this problem is also known as the weighted constraint satisfaction proble... 详细信息
来源: 评论
Finding Solutions by Finding Inconsistencies  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Ziat, Ghiles Pelleau, Marie Truchet, Charlotte Mine, Antoine Sorbonne Univ CNRS Lab Informat Paris 6 LIP6 F-75005 Paris France Univ Cote Azur CNRS I3S Nice France Univ Nantes TASC LS2N UMR 6004 Nantes France
In continuous constraint programming, the solving process alternates propagation steps, which reduce the search space according to the constraints, and branching steps. In practice, the solvers spend a lot of computat... 详细信息
来源: 评论
Domain Reduction for Valued constraints by Generalising Methods from CSP  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Cooper, Martin C. Jguirim, Wafa Cohen, David A. Univ Toulouse III IRIT Toulouse France Univ Manouba Natl Sch Comp Sci Manouba Tunisia Royal Holloway Univ London Dept Comp Sci Egham Surrey England
For classical CSPs, the absence of broken triangles on a pair of values allows the merging of these values without changing the satisfiability of the instance, giving experimentally verified reduction in search time. ... 详细信息
来源: 评论
Towards Effective Deep Learning for constraint Satisfaction Problems  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Xu, Hong Koenig, Sven Kumar, T. K. Satish Univ Southern Calif Los Angeles CA 90089 USA
Many attempts have been made to apply machine learning techniques to constraint satisfaction problems (CSPs). However, none of them have made use of the recent advances in deep learning. In this paper, we apply deep l... 详细信息
来源: 评论
An SMT Approach to Fractional Hypertree Width  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Fichte, Johannes K. Hecher, Markus Lodha, Neha Szeider, Stefan Tech Univ Dresden Int Ctr Computat Log Dresden Germany TU Wien Database & Artificial Intelligence Grp Vienna Austria TU Wien Algorithms & Complex Grp Vienna Austria
Bounded fractional hypertree width (fhtw) is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Bounded fhtw generalizes other structural pro... 详细信息
来源: 评论