咨询与建议

限定检索结果

文献类型

  • 62 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 50 篇 工学
    • 48 篇 计算机科学与技术...
    • 13 篇 软件工程
    • 1 篇 电气工程
    • 1 篇 交通运输工程
  • 48 篇 理学
    • 44 篇 数学
    • 14 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 1 篇 管理学
    • 1 篇 图书情报与档案管...

主题

  • 12 篇 constraint satis...
  • 12 篇 constraint theor...
  • 5 篇 computer program...
  • 3 篇 linear programmi...
  • 3 篇 constraint progr...
  • 1 篇 bandit
  • 1 篇 constraint logic...
  • 1 篇 query languages
  • 1 篇 inverse problems
  • 1 篇 large neighborho...
  • 1 篇 problem solving
  • 1 篇 chaotic dynamica...
  • 1 篇 modeling languag...
  • 1 篇 adaptive search
  • 1 篇 concolic testing
  • 1 篇 soft neighborhoo...
  • 1 篇 containers
  • 1 篇 optimal systems
  • 1 篇 redundancy
  • 1 篇 iterative method...

机构

  • 2 篇 cork constraint ...
  • 2 篇 université côte ...
  • 2 篇 univ coll cork c...
  • 2 篇 univ melbourne m...
  • 2 篇 faculty of elect...
  • 1 篇 free univ amster...
  • 1 篇 univ st andrews ...
  • 1 篇 université côte ...
  • 1 篇 univ nantes lina...
  • 1 篇 tech univ catalo...
  • 1 篇 nicta nsw
  • 1 篇 univ melbourne n...
  • 1 篇 antwerp maritime...
  • 1 篇 univ melbourne d...
  • 1 篇 ujf cnrs grenobl...
  • 1 篇 univ york york y...
  • 1 篇 univ artois cnrs...
  • 1 篇 cnrs lirmm f-343...
  • 1 篇 univ autonoma ba...
  • 1 篇 algorithms and c...

作者

  • 5 篇 stuckey peter j.
  • 4 篇 régin jean-charl...
  • 3 篇 pearson justin
  • 3 篇 werner tomáš
  • 3 篇 chu geoffrey
  • 3 篇 dlask tomáš
  • 3 篇 flener pierre
  • 3 篇 o'sullivan barry
  • 2 篇 prestwich steven...
  • 2 篇 thorstensen evge...
  • 2 篇 isoart nicolas
  • 2 篇 miguel ian
  • 2 篇 nightingale pete...
  • 2 篇 gent ian p.
  • 2 篇 de givry simon
  • 2 篇 schaus pierre
  • 1 篇 schoenauer marc
  • 1 篇 prestwich steven
  • 1 篇 fargier helene
  • 1 篇 fontaine daniel

语言

  • 63 篇 英文
检索条件"任意字段=19th International Conference on Principles and Practice of Constraint Programming, CP 2013"
63 条 记 录,以下是51-60 订阅
排序:
Inter-instance nogood learning in constraint programming
Inter-instance nogood learning in constraint programming
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Chu, Geoffrey Stuckey, Peter J. National ICT Australia Department of Computer Science and Software Engineering University of Melbourne Australia
Lazy Clause Generation is a powerful approach to reducing search in constraint programming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called no... 详细信息
来源: 评论
Bounds on Weighted CSPs using constraint propagation and super-reparametrizations  27
Bounds on Weighted CSPs using constraint propagation and sup...
收藏 引用
27th international conference on principles and practice of constraint programming, cp 2021
作者: Dlask, Tomáš Werner, Tomáš De Givry, Simon Faculty of Electrical Engineering Czech Technical University in Prague Czech Republic Université Fédérale de Toulouse ANITI INRAE UR 875 France
We propose a framework for computing upper bounds on the optimal value of the (maximization version of) Weighted CSP (WCSP) using super-reparametrizations, which are changes of the weights that keep or increase the WC... 详细信息
来源: 评论
On Redundancy in constraint Satisfaction Problems  28
On Redundancy in Constraint Satisfaction Problems
收藏 引用
28th international conference on principles and practice of constraint programming, cp 2022
作者: Carbonnel, Clément CNRS LIRMM University of Montpellier France
A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(nr), but there are... 详细信息
来源: 评论
Bounding Linear Programs by constraint Propagation: Application to Max-SAT  26th
Bounding Linear Programs by Constraint Propagation: Applicat...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic
the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this tech... 详细信息
来源: 评论
On Relation Between constraint Propagation and Block-Coordinate Descent in Linear Programs  26th
On Relation Between Constraint Propagation and Block-Coordin...
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic
Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally ... 详细信息
来源: 评论
ACM international conference Proceeding Series
ACM International Conference Proceeding Series
收藏 引用
19th international Symposium on principles and practice of Declarative programming, PPDP 2017
the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstrac...
来源: 评论
MDD Archive for Boosting the Pareto constraint  29
MDD Archive for Boosting the Pareto Constraint
收藏 引用
29th international conference on principles and practice of constraint programming, cp 2023
作者: Malalel, Steve Malapert, Arnaud Pelleau, Marie Régin, Jean-Charles Université Côte d'Azur CNRS I3S Nice France
Multi-objective problems are frequent in the real world. In general they involve several incomparable objectives and the goal is to find a set of Pareto optimal solutions, i.e. solutions that are incomparable two by t... 详细信息
来源: 评论
A framework for constraint programming based column generation  5th
收藏 引用
5th international conference on principles and practice of constraint programming, cp 1999
作者: Junker, Ulrich Karisch, Stefan E. Kohl, Niklas Vaaben, Bo Fahle, Torsten Sellmann, Meinolf ILOG S.A. 1681 route des Dolines ValbonneF-06560 France Carmen Systems AB Odinsgatan 9 GothenburgS-41103 Sweden Technical University of Denmark Department of Mathematical Modelling Building 321 LyngbyDK-2800 Denmark University of Paderborn Department of Mathematics and Computer Science Fürstenallee 11 PaderbornD-33102 Germany
Column generation is a state-of-the-art method for optimally solving difficult large-scale optimization problems such as airline crew assignment. We show how to apply column generation even if those problems have comp... 详细信息
来源: 评论
Breaking Symmetries with RootClique and LexTopSort  26th
Breaking Symmetries with RootClique and LexTopSort
收藏 引用
26th international conference on principles and practice of constraint programming, cp 2020
作者: Fichte, Johannes K. Hecher, Markus Szeider, Stefan School of Engineering Sciences TU Dresden Dresden Germany Database and Artificial Intelligence Group TU Wien Vienna Austria Algorithms and Complexity Group TU Wien Vienna Austria
Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and ... 详细信息
来源: 评论
Consistency maintenance for ABT  1
收藏 引用
7th international conference on principles and practice of constraint programming, cp 2001
作者: Silaghi, Marius-Călin Sam-Haroud, Djamila Faltings, Boi EPFL CH-1015 Switzerland
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such... 详细信息
来源: 评论