咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是281-290 订阅
排序:
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 ... 详细信息
来源: 评论
Implementing global constraints with index-sets and constraint templates  4th
收藏 引用
4th international conference on principles and practice of constraint programming (CP 98)
作者: Colombani, Y Dash Associates Leamington Spa CV32 5TH England
In order to improve the deductive power of ffinite domain constraint solvers usually redundant and global constraints are added to the constraint system. the objective of this work [2] is to develop a new constraint s... 详细信息
来源: 评论
Broken Triangles Revisited  21st
Broken Triangles Revisited
收藏 引用
21st international conference on the principles and practice of constraint programming (CP)
作者: Cooper, Martin C. Duchein, Aymeric Escamocher, Guillaume Univ Toulouse 3 IRIT F-31062 Toulouse France Natl Univ Ireland Univ Coll Cork INSIGHT Ctr Data Analyt Cork Ireland
A broken triangle is a pattern of (in) compatibilities between assignments in a binary CSP (constraint satisfaction problem). In the absence of certain broken triangles, satisfiability-preserving domain reductions are... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
Compiling constraint networks into AND/OR multi-valued decis...
收藏 引用
12th international conference on principles and practice of constraint programming (CP 2006)
作者: Mateescu, Robert Dechter, Rina Univ Calif Irvine Donald Bren Sch Informat & Comp Sci Irvine CA 92697 USA
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function decomposition structure. this yields AND/OR multi... 详细信息
来源: 评论
Search Space Reduction for constraint Optimization Problems
收藏 引用
14th international conference on principles and practice of constraint programming (CP 2008)
作者: Cheng, Kenil C. K. Yap, Roland H. C. Natl Univ Singapore Sch Computing Singapore Singapore
In a constraint optimization problem (COP), many feasible assignment's have the same objective value. this usually means huge search space and poor propagation among the objective variables (which appear in the ob... 详细信息
来源: 评论
Maintaining longest paths incrementally
收藏 引用
constraintS 2005年 第2期10卷 159-183页
作者: Katriel, I Michel, L Van Hentenryck, P Max Planck Inst Informat Saarbrucken Germany Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA
Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. this paper considers invariants ... 详细信息
来源: 评论
A polynomial time local propagation algorithm for general dataflow constraint problems  4th
收藏 引用
4th international conference on principles and practice of constraint programming (CP 98)
作者: Trombettoni, G Ecole Polytech Fed Lausanne Artificial Intelligence Lab CH-1015 Lausanne Switzerland
the multi-way dataflow constraint model allows a user to describe interactive applications whose consistency is maintained by a local propagation algorithm. Local propagation applies a sequence of methods that solve t... 详细信息
来源: 评论
A Generic Visualization Platform for CP
A Generic Visualization Platform for CP
收藏 引用
16th Annual international conference on the principles and practice of constraint programming
作者: Simonis, Helmut Davern, Paul Feldman, Jacob Mehta, Deepak Quesada, Luis Carlsson, Mats Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland Swedish Inst Comp Sci SICS AB Uppsala Sweden
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, and the state of constraints and vari... 详细信息
来源: 评论
Where are the interesting problems?
Where are the interesting problems?
收藏 引用
18th international conference on principles and practice of constraint programming, CP 2012
作者: O'Sullivan, Barry Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
constraint programming has become an important technology for solving hard combinatorial problems in a diverse range of application domains. It has its roots in artificial intelligence, mathematical programming, opera... 详细信息
来源: 评论