咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
constraint-Based Graph Matching
Constraint-Based Graph Matching
收藏 引用
15th international conference on principles and practice of constraint programming (cp 2009)
作者: le Clement, Vianney Deville, Yves Solnon, Christine Catholic Univ Louvain Dept Comp Sci & Engn Pl St Barbe 2 B-1348 Louvain Belgium Univ Lyon F-69622 Villeurbanne France Univ Lyon 1 CNRS LIRIS UMR 5205 F-69622 Villeurbanne France
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Industrial Size Job Shop Scheduling Tackled by Present Day cp Solvers  25th
Industrial Size Job Shop Scheduling Tackled by Present Day C...
收藏 引用
25th international conference on the principles and practice of constraint programming (cp)
作者: Da Col, Giacomo Teppan, Erich C. Alpen Adria Univ Klagenfurt A-9020 Klagenfurt Austria
the job shop scheduling problem (JSSP) is an abstraction of industrial scheduling and has been studied since the dawn of the computer era. Its combinatorial nature makes it easily expressible as a constraint satisfact... 详细信息
来源: 评论
constraint symmetry for the soft CSP
Constraint symmetry for the soft CSP
收藏 引用
13th international conference on principles and practice of constraint programming (cp 2007)
作者: Smith, Barbara M. Bistarelli, Stefano O'Sullivan, Barry Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England CNR Ist Informat & Telemat I-00185 Pisa Italy Univ G dAnnunzio Dipartimento Sci Pescara Italy Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a soft CSP is a subgroup of that of an a... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A Precedence constraint Posting Approach for the RcpSP with Time Lags and Variable Durations
A Precedence Constraint Posting Approach for the RCPSP with ...
收藏 引用
15th international conference on principles and practice of constraint programming (cp 2009)
作者: Lombardi, Michele Milano, Michela Univ Bologna DEIS I-40136 Bologna Italy
Resource Constrained Project;Scheduling Problem is a very important problem in project management, manufacturing and resource optimization. We focus on a variant of RcpSP with time lags and variable activity durations... 详细信息
来源: 评论
constraint-based verification of client-server protocols  7
收藏 引用
7th international conference on principles and practice of constraint programming, cp 2001
作者: Delzanno, Giorgio Bultan, Tevfik Dipartimento di Informatica e Scienze dell’Informazione Università di Genova via Dodecaneso 35 16146 Italy Department of Computer Science University of California Santa BarbaraCA93106 United States
We show that existing constraint manipulation technology incorporated in the paradigm of symbolic model checking with rich assertional languages [KMM+97], can be successfully applied to the verification of client-serv... 详细信息
来源: 评论
Extending CLP with Metaheuristics  9th
收藏 引用
9th international conference on principles and practice of constraint programming, cp 2003
作者: Boysen, Ole Fraunhofer FIRST Kekuléstraße 7 Berlin Germany
来源: 评论