咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是881-890 订阅
排序:
Open constraint satisfaction  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Faltings, Boi Macho-Gonzalez, Santiago IN-Ecublens EcublensCH-1015 Switzerland
Traditionally, constraint satisfaction has been applied inclosed-world scenarios,where all choices and constraints are known from the beginning and fixed. With the Internet, many of the traditional CSP applications in... 详细信息
来源: 评论
Disjunctive and continuous constraint satisfaction problems  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Salido, Miguel A. Barber, Federico Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Spain
In this work, we extend the class of Horn constraints to include disjunctions with an arbitrary number of linear inequalities, linear disequations and non-linear disequations. We propose a preprocess step in which two... 详细信息
来源: 评论
constraint programming contribution to benders decomposition: A case study  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Benoist, thierry Gaudin, Etienne Rottembourg, Benoit Bouygues e-lab 1 av EugLne Freyssinet St Quentin en Yvelines Cedex78061 France
the aim of this paper is to demonstrate that CP could be abetter candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce sch... 详细信息
来源: 评论
A linear programming based satisfiability solver using a new horn-driven search tree design
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: van Norden, Linda van Maaren, Hans Technical University Delft Mekelweg 4 Delft Netherlands P.O. Box 5031 Delft Netherlands
来源: 评论
Partial symmetry breaking  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: McDonald, Iain Smith, Barbara University of St Andrews Fife United Kingdom University of Huddersfield West Yorkshire United Kingdom
In this paper we define partial symmetry breaking, a concept that has been used in many previous papers without being the main topic of any research. this paper is the first systematic study of partial symmetry breaki... 详细信息
来源: 评论
Interchangeability in soft CSPs  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Bistarelli, Stefano Faltings, Boi Neagu, Nicoleta CNR Pisa Italy EPFL Ecublens Switzerland
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the sa... 详细信息
来源: 评论
On constraint problems with incomplete or erroneous data  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Yorke-Smith, Neil IC–Parc Imperial College London United Kingdom
Real-world constraint problems abound with *** with incomplete or erroneous data are often simplified at present to tractable deterministic models, or modified using error correction methods, with the aim of seeking a... 详细信息
来源: 评论
Resolution complexity of random constraints  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Mitchell, David G. Simon Fraser University Burnaby Canada
Random instances are widely used as benchmarks in evaluating algorithms for finite-domain constraint satisfaction problems (CSPs).We present an analysis that shows why deciding satisfiability of instances from some di... 详细信息
来源: 评论
Characterizing SAT problems with the row convexity property  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Bennaceur, Hachemi Li, Chu Min LIPN Institut Galilée Université Paris 13 Av J B Clément Villetaneuse93240 France LaRIA Université de Picardie Jules Verne 5 Rue du Moulin Neuf Amiens80000 France
Using the literal encoding of the satisfiability problem (SAT)as a binary constraint satisfaction problem (CSP), we relate the path consistency concept and the row convexity of CSPs with the inference rules in the pro... 详细信息
来源: 评论
Beyond NP: Arc-consistency for quantified constraints  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Bordeaux, Lucas Monfroy, Eric France
the generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other ... 详细信息
来源: 评论