咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是841-850 订阅
排序:
Box constraint collections for adhoc constraints
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Cheng, Chi Kan Lee, Jimmy Ho Man Stuckey, Peter J. Dept of Comp. Sci. and Eng The Chinese University of Hong Kong Hong Kong Dept. of Comp. Sci. and Soft. Eng University of Melbourne Australia
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop... 详细信息
来源: 评论
Symmetry breaking using stabilizers
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Puget, Jean-François ILOG 9 avenue de Verdun Gentilly94253 France
the addition of symmetry breaking constraints is one of the most successful symmetry breaking technique for constraint satisfaction problems (CSP). In this paper we present STAB, a method that adds some symmetry break... 详细信息
来源: 评论
An algebraic approach to multi-sorted constraints
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Bulatov, Andrei A. Jeavons, Peter Computing Laboratory University of Oxford United Kingdom
Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparentl... 详细信息
来源: 评论
Discrepancy-based additive bounding for the alldifferent constraint
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Lodi, Andrea Milano, Michela Rousseau, Louis-Martin D.E.I.S Università di Bologna Viale Risorgimento 2 Bologna40136 Italy Centre for Research on Transportation Université de Montréal CP 6128 Succ Centre-Ville MontréalH3C 3J7 Canada
In this paper we show how to exploit in constraint programming (CP) a well-known integer programming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search ... 详细信息
来源: 评论
A formal approach to agent design: An overview of constraint-based agents
A formal approach to agent design: An overview of constraint...
收藏 引用
6th international conference on principles and practice of constraint programming
作者: Mackworth, AK Zhang, Y Univ British Columbia Dept Comp Sci Lab Computat Intelligence Vancouver BC V6T 1Z4 Canada Xerox Corp Palo Alto Res Ctr Syst & Practices Lab Palo Alto CA 94304 USA
Formal models for agent design are important for both practical and theoretical reasons. the constraint-Based Agent (CBA) design approach includes two formal models: constraint Nets and Timed For All-automata. A const... 详细信息
来源: 评论
Soft constraints: Complexity and multimorphisms
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Cohen, David A. Cooper, Martin Jeavons, Peter Krokhin, Andrei Department of Computer Science Royal Holloway University of London United Kingdom IRIT University of Toulouse III France Computing Laboratory University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful... 详细信息
来源: 评论
New tractable classes from old
New tractable classes from old
收藏 引用
6th international conference on principles and practice of constraint programming
作者: Cohen, D Jeavons, P Gault, R Univ London Dept Comp Sci Royal Holloway London WC1E 7HU England Univ Oxford Comp Lab Oxford OX1 3QD England
the constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. this paper introduces two simple method... 详细信息
来源: 评论
Solving finite domain constraint hierarchies by local consistency and tree search
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Bistarelli, Stefano Codognet, Philippe Hui, Kin-Chuen Lee, Jimmy Ho Man Istituto di Informatica e Telematica CNR Pisa Italy Dipartimento di Scienze Universitá degli Studi ‘G. D’annunzio’ di Chieti-Pescara Italy Department of Computer Science University of Paris 6 France Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (... 详细信息
来源: 评论
constraints for breaking more row and column symmetries
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Frisch, Alan M. Jefferson, Chris Miguel, Ian Artificial Intelligence Group Department of Computer Science University of York York United Kingdom
constraint programs containing a matrix of two (or more) dimensions of decision variables often have row and column symmetries: in any assignment to the variables the rows can be swapped and the columns can be swapped... 详细信息
来源: 评论
Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
Boosting search with variable elimination in constraint opti...
收藏 引用
6th international conference on principles and practice of constraint programming
作者: Larrosa, J Dechter, R Univ Politecn Cataluna Barcelona Spain Univ Calif Irvine Irvine CA USA
there are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is varia... 详细信息
来源: 评论