咨询与建议

限定检索结果

文献类型

  • 131 篇 会议
  • 2 篇 期刊文献

馆藏范围

  • 133 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 118 篇 工学
    • 114 篇 计算机科学与技术...
    • 38 篇 软件工程
    • 4 篇 电气工程
    • 3 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 电子科学与技术(可...
    • 1 篇 控制科学与工程
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
  • 68 篇 理学
    • 60 篇 数学
    • 21 篇 系统科学
    • 4 篇 物理学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
  • 11 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 7 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 26 篇 constraint theor...
  • 14 篇 constraint satis...
  • 9 篇 computer program...
  • 8 篇 constraint progr...
  • 6 篇 linear programmi...
  • 4 篇 integer programm...
  • 3 篇 target cost
  • 3 篇 problem solving
  • 3 篇 goal programming
  • 3 篇 scheduling
  • 2 篇 modeling languag...
  • 2 篇 symmetry
  • 2 篇 constrained opti...
  • 2 篇 logic programmin...
  • 2 篇 global constrain...
  • 2 篇 simplex method
  • 2 篇 combinatorial op...
  • 2 篇 answer set progr...
  • 1 篇 object oriented ...
  • 1 篇 bandit

机构

  • 3 篇 univ coll cork c...
  • 3 篇 univ st andrews ...
  • 3 篇 univ oxford comp...
  • 3 篇 natl univ irelan...
  • 3 篇 univ melbourne m...
  • 3 篇 brown univ provi...
  • 2 篇 univ st andrews ...
  • 2 篇 nicta nsw
  • 2 篇 insight centre f...
  • 2 篇 univ genoa dibri...
  • 2 篇 cork constraint ...
  • 2 篇 univ coll cork d...
  • 2 篇 univ london roya...
  • 2 篇 imdea software i...
  • 2 篇 aix marseille un...
  • 2 篇 aix marseille un...
  • 2 篇 univ coll cork c...
  • 2 篇 faculty of elect...
  • 2 篇 univ st andrews ...
  • 1 篇 ligm ecole des p...

作者

  • 6 篇 nightingale pete...
  • 6 篇 gent ian p.
  • 6 篇 o'sullivan barry
  • 5 篇 miguel ian
  • 5 篇 van hentenryck p...
  • 5 篇 jefferson christ...
  • 5 篇 quesada luis
  • 4 篇 kotthoff lars
  • 4 篇 bessiere christi...
  • 4 篇 de givry simon
  • 3 篇 stuckey peter j.
  • 3 篇 werner tomáš
  • 3 篇 jeavons peter
  • 3 篇 simonis helmut
  • 3 篇 lombardi michele
  • 3 篇 walsh toby
  • 3 篇 dlask tomáš
  • 3 篇 mehta deepak
  • 2 篇 pearson justin
  • 2 篇 solnon christine

语言

  • 133 篇 英文
检索条件"任意字段=16th Annual International Conference on the Principles and Practice of Constraint Programming"
133 条 记 录,以下是121-130 订阅
排序:
A time-space trade-off for constraint networks decomposition
A time-space trade-off for constraint networks decomposition
收藏 引用
16th IEEE international conference on Tools with Artificial Intelligence
作者: Jégou, P Terrioux, C Univ Aix Marseille 3 F-13397 Marseille 20 France
We study here a CSP decomposition method introduced in [9] and called Cyclic-Clustering. While [9] only presents the principles of the method, this paper explains how this method can be made operational by exploiting ... 详细信息
来源: 评论
(Smart) look-ahead arc consistency and the pursuit of CSP tractability
收藏 引用
10th international conference on the principles and practice of constraint programming
作者: Chen, HB Dalmau, V Cornell Univ Dept Comp Sci Ithaca NY 14853 USA Univ Pompeu Fabra Dept Tecnol Barcelona Spain
the constraint satisfaction problem (CSP) can be formulated as the problem of deciding, given a pair (A, B) of relational structures, whether or not there is a homomorphism from A to B. Although the CSP is in general ... 详细信息
来源: 评论
A time-space trade-off for constraint networks decomposition
A time-space trade-off for constraint networks decomposition
收藏 引用
international conference on Tools for Artificial Intelligence (ICTAI)
作者: P. Jegou C. Terrioux LSIS Université Aix Marseille 3 Marseilles France
We study here a CSP decomposition method introduced in [P. Jegou (1990)] and called cyclic-clustering. While [P. Jegou (1990)] only presents the principles of the method, this work explains how this method can be made... 详细信息
来源: 评论
Local search with maximal independent sets
收藏 引用
10th international conference on principles and practice of constraint programming, CP 2004
作者: Gompert, Joel M. Constraint Systems Laboratory University of Nebraska-Lincoln United States
When solving constraint Satisfaction Problems (CSPs), it is desirable to find multiple solutions, or to find solutions that are robust, allowing us to modify the values of variables without breaking the solution. Furt...
来源: 评论
Search programming  9th
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Legierski, Wojciech Institute of Automatic Control Silesian Technical University Akademicka 16 Gliwice Poland
来源: 评论
Exploiting multidirectionality in coarse-grained arc consistency algorithms
收藏 引用
9th international conference on principles and practice of constraint programming, CP 2003
作者: Lecoutre, Christophe Boussemart, Frédéric Hemery, Fred CNRS FRE 2499 Rue de l’université SP 16 Lens cedex62307 France
Arc consistency plays a central role in solving constraint Satisfaction Problems. this is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been inde... 详细信息
来源: 评论
Groups and constraints: Symmetry breaking during search  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Gent, Ian P. Harvey, Warwick Kelsey, Tom School of Computer Science University of St Andrews St Andrews FifeKY16 9SS United Kingdom IC-Parc Imperial College Exhibition Road LondonSW7 2AZ United Kingdom
We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. the interface provides a method for efficiently dealing with large numbers of symmetri... 详细信息
来源: 评论
Neighborhood-based variable ordering heuristics for the constraint satisfaction problem  7
收藏 引用
7th international conference on principles and practice of constraint programming, CP 2001
作者: Bessière, Christian Chmeiss, Assef Saïs, Lakhdar 161 rue Ada Montpellier Cedex 534392 France CRIL - Université d’ Artois IUT de Lens Rue de l’université - SP 16 LENS Cedex62307 France
One of the key factors in the efficiency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of d... 详细信息
来源: 评论
A constraint programming approach to the stable marriage problem  1
收藏 引用
7th international conference on principles and practice of constraint programming, CP 2001
作者: Gent, Ian P Irving, Robert W Manlove, David F Prosser, Patrick Smith, Barbara M School of Computer Science University of St. Andrews United Kingdom Department of Computing Science University of Glasgow United Kingdom School of Computing and Mathematics University of Huddersfield United Kingdom
the Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a constraint Satisfa... 详细信息
来源: 评论
A constraint-based framework for prototyping distributed virtual applications  6th
收藏 引用
6th international conference on principles and practice of constraint programming, CP2000
作者: Gupta, Vineet Jagadeesan, Lalita Jategaonkar Jagadeesan, Radha Jiang, Xiaowei Läufer, Konstantin 201 Ravendale Mountain ViewCA94043 United States Software Production Research Dept Bell Laboratories Lucent Technologies 263 Shuman Blvd NapervilleIL60566 United States Dept. of Mathematical and Computer Sciences Loyola University Chicago 6525 N. Sheridan Road ChicagoIL60626 United States
this paper describes the architecture and implementation of a constraint-based framework for rapid prototyping of distributed applications such as virtual simulations, collaborations and games. Our framework integrate... 详细信息
来源: 评论