咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Learning a Generic Value-Selection Heuristic Inside a constraint programming Solver  29
Learning a Generic Value-Selection Heuristic Inside a Constr...
收藏 引用
29th international conference on principles and practice of constraint programming, CP 2023
作者: Marty, Tom François, Tristan Tessier, Pierre Gautier, Louis Rousseau, Louis-Martin Cappart, Quentin Polytechnique Montréal Montreal Canada Ecole Polytechnique Palaiseau France
constraint programming is known for being an efficient approach to solving combinatorial problems. Important design choices in a solver are the branching heuristics, designed to lead the search to the best solutions i... 详细信息
来源: 评论
Restart policies with dependence among runs: A dynamic programming approach  8th
收藏 引用
8th international conference on principles and practice of constraint programming, CP 2002
作者: Ruan, Yongshao Horvitz, Eric Kautz, Henry University of Washington SeattleWA98195 United States Microsoft Research RedmondWA98052 United States
the time required for a backtracking search procedure to solve a problem can be minimized by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assu... 详细信息
来源: 评论
Large Neighborhood Search for Robust Solutions for constraint Satisfaction Problems with Ordered Domains  28
Large Neighborhood Search for Robust Solutions for Constrain...
收藏 引用
28th international conference on principles and practice of constraint programming, CP 2022
作者: López, Jheisson Arbelaez, Alejandro Climent, Laura University College Cork School of Computer Science Ireland SFI Centre for Research Training in Artificial Intelligence Cork Ireland Department of Computer Engineering Autonomous University of Madrid Spain
Often, real-world constraint Satisfaction Problems (CSPs) are subject to uncertainty/dynamism not known in advance. Some techniques in the literature offer robust solutions for CSPs. Here, we analyze a previous exact/... 详细信息
来源: 评论
Improved bound computation in presence of several clique constraints
收藏 引用
10th international conference on principles and practice of constraint programming, CP 2004
作者: Puget, Jean-Francois ILOG 9 avenue de Verdun Gentilly94253 France
Bound consistency can easily and efficiently be enforced on linear constraint. However, bound consistency techniques deal with every constraint separately. We show that in some cases much stronger bounds can be comput... 详细信息
来源: 评论
Global constraints for integer and set value precedence
收藏 引用
10th international conference on principles and practice of constraint programming, CP 2004
作者: Law, Yat Chiu Lee, Jimmy H. M. Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin Hong Kong
the paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of symmetries in practice. Although valu... 详细信息
来源: 评论
Machine learning for portfolio selection using structure at the instance level
收藏 引用
10th international conference on the principles and practice of constraint programming
作者: Gebruers, C Guerri, A Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Univ Bologna DEIS I-40136 Bologna Italy
Many combinatorial optimization problems do not have a clear structure, may present many side constraints, and may include subproblems. In addition, different instances within the same domain can have different struct...
来源: 评论
A hyper-arc consistency algorithm for the soft alldifferent constraint
收藏 引用
10th international conference on principles and practice of constraint programming, CP 2004
作者: Van Hoeve, Willem Jan CWI P.O. Box 94079 Amsterdam1090 GB Netherlands
this paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem. Consistency of the constra... 详细信息
来源: 评论
A linear time algorithm for the k-cutset constraint  27
A linear time algorithm for the k-cutset constraint
收藏 引用
27th international conference on principles and practice of constraint programming, CP 2021
作者: Isoart, Nicolas Régin, Jean-Charles Université Côte d'Azur Nice France
In CP, the most efficient model solving the TSP is the Weighted Circuit constraint (WCC) combined with the k-cutset constraint. the WCC is mainly based on the edges cost of a given graph whereas the k-cutset constrain... 详细信息
来源: 评论
Preprocessing techniques for distributed constraint optimization
收藏 引用
10th international conference on principles and practice of constraint programming, CP 2004
作者: Ali, Syed Muhammad Koenig, Sven Tambe, Milind USC CS Department 941 W 37th Street Los AngelesCA90089-0781 United States
Although algorithms for Distributed constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significant hurdles in many multiagent domains due to the... 详细信息
来源: 评论
DPMC: Weighted Model Counting by Dynamic programming on Project-Join Trees  26th
DPMC: Weighted Model Counting by Dynamic Programming on Proj...
收藏 引用
26th international conference on principles and practice of constraint programming, CP 2020
作者: Dudek, Jeffrey M. Phan, Vu H. N. Vardi, Moshe Y. Rice University HoustonTX77005 United States
We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are project-join trees, which specify efficient... 详细信息
来源: 评论