咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是31-40 订阅
排序:
Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds
Pseudo-tree-based incomplete algorithm for distributed const...
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: Okimoto, Tenda Joe, Yongjoon Iwasaki, Atsushi Yokoo, Makoto Faltings, Boi Kyushu University Fukuoka8190395 Japan LausanneCH-1015 Switzerland
A Distributed constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, considering faster incomplete algorithms i... 详细信息
来源: 评论
Orchestrating satisfiability engines  17th
Orchestrating satisfiability engines
收藏 引用
17th international conference on principles and practice of constraint programming, cp 2011
作者: de Moura, Leonardo Microsoft Research One Microsoft Way RedmondWA98052 United States
constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, static program analysis, test-case generation, scheduling, planning and graph problems. these ... 详细信息
来源: 评论
the goldilocks problem  5th
收藏 引用
5th international conference on principles and practice of constraint programming, cp 1999
作者: Hulubei, Tudor Freuder, Eugene C. Department of Computer Science University of New Hampshire DurhamNH03824 United States
A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are ... 详细信息
来源: 评论
A scalable linear constraint solver for user interface construction  6th
收藏 引用
6th international conference on principles and practice of constraint programming, cp2000
作者: Hosobe, Hiroshi National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-kuTokyo101-8430 Japan
this paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU d... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Towards solver-independent propagators
Towards solver-independent propagators
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Monette, Jean-Noël Flener, Pierre Pearson, Justin Department of Information Technology Uppsala University Uppsala Sweden
We present an extension to indexicals to describe propagators for global constraints. the resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show h... 详细信息
来源: 评论
Soft constraints: Complexity and multimorphisms
收藏 引用
9th international conference on principles and practice of constraint programming, cp 2003
作者: Cohen, David A. Cooper, Martin Jeavons, Peter Krokhin, Andrei Department of Computer Science Royal Holloway University of London United Kingdom IRIT University of Toulouse III France Computing Laboratory University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful... 详细信息
来源: 评论
Revisiting neighborhood inverse consistency on binary CSPs
Revisiting neighborhood inverse consistency on binary CSPs
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Woodward, Robert J. Karakashian, Shant Choueiry, Berthe Y. Bessiere, Christian Constraint Systems Laboratory University of Nebraska-Lincoln United States LIRMM-CNRS University of Montpellier France
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structur... 详细信息
来源: 评论
Weibull-based benchmarks for bin packing
Weibull-based benchmarks for bin packing
收藏 引用
18th international conference on principles and practice of constraint programming, cp 2012
作者: Castiñeiras, Ignacio De Cauwer, Milan O'Sullivan, Barry Dpto. de Sistemas Informáticos Y Computación Universidad Complutense de Madrid Spain Département Informatique Université de Nantes France Cork Constraint Computation Centre University College Cork Ireland
Bin packing is a ubiquitous problem that arises in many practical applications. the motivation for the work presented here comes from the domain of data centre optimisation. In this paper we present a parameterisable ... 详细信息
来源: 评论