咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
A Join-Based Hybrid Parameter for constraint Satisfaction  25th
A Join-Based Hybrid Parameter for Constraint Satisfaction
收藏 引用
25th international conference on the principles and practice of constraint programming (cp)
作者: Ganian, Robert Ordyniak, Sebastian Szeider, Stefan TU Wien Algorithms & Complex Grp Vienna Austria Univ Sheffield Algorithms Grp Sheffield S Yorkshire England
We propose joinwidth, a new complexity parameter for the constraint Satisfaction Problem (CSP). the definition of joinwidth is based on the arrangement of basic operations on relations (joins, projections, and pruning... 详细信息
来源: 评论
constraint-Based Techniques in Stochastic Local Search MaxSAT Solving  25th
Constraint-Based Techniques in Stochastic Local Search MaxSA...
收藏 引用
25th international conference on the principles and practice of constraint programming (cp)
作者: Guerreiro, Andreia P. Terra-Neves, Miguel Lynce, Ines Figueira, Jose Rui Manquinho, Vasco Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal OutSystems Lisbon Portugal Univ Lisbon Inst Super Tecn CEG IST Lisbon Portugal
the recent improvements in solving Maximum Satisfiability (MaxSAT) problems has allowed the usage of MaxSAT in several application domains. However, it has been observed that finding an optimal solution in a reasonabl... 详细信息
来源: 评论
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean constraints  25th
Automatic Detection of At-Most-One and Exactly-One Relations...
收藏 引用
25th international conference on the principles and practice of constraint programming (cp)
作者: Ansotegui, Carlos Bofill, Miquel Coll, Jordi Nguyen Dang Luis Esteban, Juan Miguel, Ian Nightingale, Peter Salamon, Andras Z. Suy, Josep Villaret, Mateu Univ Lleida Lleida Spain Univ Girona Girona Spain Univ St Andrews St Andrews Fife Scotland Tech Univ Catalonia Barcelona Spain Univ York York N Yorkshire England
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care... 详细信息
来源: 评论
Solution-Based Phase Saving for cp: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers  1
收藏 引用
24th international conference on the principles and practice of constraint programming (cp)
作者: Demirovic, Emir Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Sch Comp & Informat Syst Melbourne Vic Australia
Large neighbourhood search, a meta-heuristic, has proven to be successful on a wide range of optimisation problems. the algorithm repeatedly generates and searches through a neighbourhood around the current best solut... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Improving Energetic Propagations for Cumulative Scheduling  1
收藏 引用
24th international conference on the principles and practice of constraint programming (cp)
作者: Tesch, Alexander Zuse Inst Berlin ZIB Takustr 7 D-14195 Berlin Germany
We consider the Cumulative Scheduling Problem (CuSP) in which a set of n jobs must be scheduled according to release dates, due dates and cumulative resource constraints. In constraint programming, the CuSP is modeled... 详细信息
来源: 评论
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...
来源: 评论
Generalized support and formal development of constraint propagators
收藏 引用
AI COMMUNICATIONS 2017年 第5期30卷 325-346页
作者: Caldwell, James Gent, Ian P. Nightingale, Peter Univ Wyoming Dept Comp Sci 1000 E Univ Ave Laramie WY 82071 USA Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland
constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) and a set of constraints that express r... 详细信息
来源: 评论
constraint-Based Fleet Design Optimisation for Multi-compartment Split-Delivery Rich Vehicle Routing  23rd
Constraint-Based Fleet Design Optimisation for Multi-compart...
收藏 引用
33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (cp) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)
作者: Urli, Tommaso Kilby, Philip Australian Natl Univ ANU CSIRO Data61 Tower ALevel 37 London Circuit Canberra ACT 2601 Australia
We describe a large neighbourhood search (LNS) solver based on a constraint programming (cp) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver su... 详细信息
来源: 评论
Clique Cuts in Weighted constraint Satisfaction  23rd
Clique Cuts in Weighted Constraint Satisfaction
收藏 引用
33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (cp) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)
作者: de Givry, Simon Katsirelos, George INRA MIAT UR 875 F-31320 Castanet Tolosan France
In integer programming, cut generation is crucial for improving the tightness of the linear relaxation of the problem. this is relevant for weighted constraint satisfaction problems (WCSPs) in which we use approximate... 详细信息
来源: 评论