咨询与建议

限定检索结果

文献类型

  • 36 篇 会议
  • 2 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 27 篇 理学
    • 21 篇 数学
    • 18 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 25 篇 工学
    • 24 篇 计算机科学与技术...
    • 16 篇 软件工程
    • 2 篇 信息与通信工程
    • 1 篇 电气工程
    • 1 篇 农业工程
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
    • 1 篇 作物学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 11 篇 constraint satis...
  • 10 篇 constraint theor...
  • 2 篇 directed graphs
  • 1 篇 hierarchical sys...
  • 1 篇 constraint gener...
  • 1 篇 weighted clones
  • 1 篇 motion planning
  • 1 篇 least core
  • 1 篇 discrete optimiz...
  • 1 篇 soft neighborhoo...
  • 1 篇 constrained opti...
  • 1 篇 constraint handl...
  • 1 篇 logic programmin...
  • 1 篇 weighted constra...
  • 1 篇 mathematical log...
  • 1 篇 propagator
  • 1 篇 tsp
  • 1 篇 global constrain...
  • 1 篇 constraint satis...
  • 1 篇 program testing

机构

  • 2 篇 cork constraint ...
  • 2 篇 mines de nantes
  • 2 篇 chinese univ hon...
  • 2 篇 cork constraint ...
  • 1 篇 computer and aut...
  • 1 篇 univ autonoma ba...
  • 1 篇 microsoft resear...
  • 1 篇 i3s umr 6070 cnr...
  • 1 篇 algorithms and c...
  • 1 篇 sics kista 16429
  • 1 篇 irit university ...
  • 1 篇 department of co...
  • 1 篇 univ paris est f...
  • 1 篇 lausanne ch-1015
  • 1 篇 ryerson univ dep...
  • 1 篇 nicta university...
  • 1 篇 natl inst inform...
  • 1 篇 national institu...
  • 1 篇 univ wyoming dep...
  • 1 篇 cnrs inria tasc ...

作者

  • 4 篇 beldiceanu nicol...
  • 3 篇 pearson justin
  • 3 篇 flener pierre
  • 3 篇 o'sullivan barry
  • 2 篇 jackson marcel
  • 2 篇 niven todd
  • 2 篇 lee jimmy h. m.
  • 2 篇 petit thierry
  • 2 篇 yokoo makoto
  • 2 篇 iwasaki atsushi
  • 1 篇 prestwich steven...
  • 1 篇 isoart nicolas
  • 1 篇 mears christophe...
  • 1 篇 cadar cristian
  • 1 篇 he jun
  • 1 篇 vilím petr
  • 1 篇 cooper martin
  • 1 篇 wallace mark
  • 1 篇 zhang wei ming
  • 1 篇 wilson nic

语言

  • 39 篇 英文
检索条件"任意字段=17th International Conference on Principles and Practice of Constraint Programming, CP 2011"
39 条 记 录,以下是21-30 订阅
排序:
Operations research and constraint programming at google  17th
Operations research and constraint programming at google
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Perron, Laurent Google SA 38 avenue de l’opéra Paris75002 France
the Operations Research and Optimization team at Google develops both general purpose optimization tools and solutions for internal optimization problems. We will describe the tools – most of which are available at h... 详细信息
来源: 评论
A Θ(n) bound-consistency algorithm for the increasing sum constraint
A Θ(n) bound-consistency algorithm for the increasing sum c...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Petit, thierry Régin, Jean-Charles Beldiceanu, Nicolas Mines de Nantes France I3S UMR 6070 CNRS Université de Nice-Sophia Antipolis France
Given a sequence of variables X = 〈x 0, x 1, …, xn − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] xi ≤ xi + 1, and Σxi∈X xi = S. We propose an Θ(n) bound-consistency algorit... 详细信息
来源: 评论
Revisiting the tree constraint
Revisiting the tree constraint
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Fages, Jean-Guillaume Lorca, Xavier École des Mines de Nantes INRIA LINA UMR CNRS 6241 Nantes Cedex 3FR-44307 France
this paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roo... 详细信息
来源: 评论
A constraint seeker: Finding and ranking global constraints from examples
A constraint seeker: Finding and ranking global constraints ...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
In this paper we describe a constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) exam... 详细信息
来源: 评论
Routefinder: Efficiently finding k shortest paths using constraint programming
Routefinder: Efficiently finding k shortest paths using cons...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Lefebvre, Michel P. Puget, Jean-François Vilím, Petr IBM 21 chemin de la Sauvegarde Ecully69130 France IBM 350 Avenue de Boulouris Saint Raphael83700 France IBM V Parku 2294/4 Praha 4Chodov148 00 Czech Republic
In this paper, we describe a constraint programming (cp) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the ... 详细信息
来源: 评论
A framework for decision-based consistencies
A framework for decision-based consistencies
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Condotta, Jean-François Lecoutre, Christophe CRIL - CNRS UMR 8188 Univ Lille Nord de France Artois LensF-62307 France
Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most ... 详细信息
来源: 评论
Filtering algorithms for discrete cumulative problems with overloads of resource
Filtering algorithms for discrete cumulative problems with o...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France
Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. ... 详细信息
来源: 评论
Pruning rules for constrained optimisation for conditional preferences
Pruning rules for constrained optimisation for conditional p...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Wilson, Nic Trabelsi, Walid Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland
A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a cp-net). this involves checking at e... 详细信息
来源: 评论
Proving symmetries by model transformation
Proving symmetries by model transformation
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Mears, Christopher Niven, Todd Jackson, Marcel Wallace, Mark Faculty of IT Monash University Australia Department of Mathematics La Trobe University Australia
the presence of symmetries in a constraint satisfaction problem gives an opportunity for more efficient search. Within the class of matrix models, we show that the problem of deciding whether some well known permutati... 详细信息
来源: 评论
Value ordering for finding all solutions: Interactions with adaptive variable ordering
Value ordering for finding all solutions: Interactions with ...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Mehta, Deepak O’Sullivan, Barry Quesada, Luis Cork Constraint Computation Centre University College Cork Ireland
We consider the impact of value ordering heuristics on the search effort required to find all solutions, or proving none exist, to a constraint satisfaction problem in k-way branching search. We show that when the var... 详细信息
来源: 评论