咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是831-840 订阅
排序:
A new class of binary CSPs for which arc-consistency is a decision procedure
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Cohen, David A. Computer Science Department Royal Holloway University of London United Kingdom
In this report weintroduce a new hybrid class for which arcconsistency is a decision procedure. this new hybrid class includes infinitely many instances whose tractability is not assured by any tractable language or s... 详细信息
来源: 评论
A hybrid constraint programming and semidefinite programming approach for the stable set problem
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Van Hoeve, Willem Jan CWI P.O. Box 94079 Amsterdam1090 GB Netherlands
this work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. the approach consists of two steps: subproblem generation and subproblem solution. First we ... 详细信息
来源: 评论
An efficient bounds consistency algorithm for the global cardinality constraint
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Quimper, Claude-Guy van Beek, Peter López-Ortiz, Alejandro Golynski, Alexander Sadjad, Sayyed Bashir School of Computer Science University of Waterloo Waterloo Canada
Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm f... 详细信息
来源: 评论
Semi-automatic modeling by constraint acquisition
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Coletta, Remi Bessière, Christian O’Sullivan, Barry Freuder, Eugene C. O’Connell, Sarah Quinqueton, Joel 161 rue Ada Montpellier Cedex 534392 France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and expertise in the field of constraint re... 详细信息
来源: 评论
Using constraint programming to solve the maximum clique problem
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Régin, Jean-Charles ILOG Sophia Antipolis Les Taissounières HB2 1681 route des Dolines Valbonne06560 France
this paper aims to show that constraint programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a graph. A clique of a graph G = (X,E) is ... 详细信息
来源: 评论
Resolution and constraint satisfaction
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Mitchell, David G. Simon Fraser University Burnaby Canada
We study two resolution-like refutation systems for finitedomain constraint satisfaction problems, and the efficiency of these and of common CSP algorithms. By comparing the relative strength of these systems, we show... 详细信息
来源: 评论
Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
收藏 引用
constraintS 2003年 第3期8卷 303-326页
作者: 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... 详细信息
来源: 评论
A formal approach to agent design: An overview of constraint-based agents
收藏 引用
constraintS 2003年 第3期8卷 229-242页
作者: 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... 详细信息
来源: 评论
New tractable classes from old
收藏 引用
constraintS 2003年 第3期8卷 263-282页
作者: 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... 详细信息
来源: 评论
Computing explanations for global scheduling constraints
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Vilím, Petr Charles University Malostranské náměstí 2/25 Praha 1 Czech Republic
Integration of explanations into a CSP solver is a technique addressing difficult question "why my problem has no solution". Besides providing some sort of answer to the user, explanations can be used for de... 详细信息
来源: 评论