咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是311-320 订阅
排序:
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs
Solving Intensional Weighted CSPs by Incremental Optimizatio...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Bofill, Miquel Palahi, Miquel Suy, Josep Villaret, Mateu Univ Girona Dept Informat Matemat Aplicada & Estat Girona Spain
We present a method for solving weighted constraint Satisfaction Problems, based on translation into a constraint Optimization Problem and iterative calls to an SMT solver, with successively tighter bounds of the obje... 详细信息
来源: 评论
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Dlala, Imen Ouled Jabbour, Said Raddaoui, Badran Sais, Lakhdar Univ Artois CNRS CRIL F-62307 Lens France Univ Paris Saclay CNRS SAMOVAR Telecom SudParis Evry France Univ Tunis LARODEC Tunis Tunisia
constraint programming (CP) and propositional satisfiability (SAT) based framework for modeling and solving pattern mining tasks has gained a considerable audience in recent years. However, this nice declarative and g... 详细信息
来源: 评论
On completion of constraint handling rules  4th
收藏 引用
4th international conference on principles and practice of constraint programming (CP 98)
作者: Abdennadher, S Frühwirth, T Univ Munich Inst Comp Sci D-80538 Munich Germany
constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is confluence: the result of... 详细信息
来源: 评论
Reduced Cost Fixing in MaxSAT  23rd
Reduced Cost Fixing in MaxSAT
收藏 引用
33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (CP) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)
作者: Bacchus, Fahiem Hyttinen, Antti Jarvisalo, Matti Saikko, Paul Univ Toronto Dept Comp Sci Toronto ON Canada Univ Helsinki HIIT Dept Comp Sci Helsinki Finland
We investigate utilizing the integer programming (IP) technique of reduced cost fixing to improve maximum satisfiability (MaxSAT) solving. In particular, we show how reduced cost fixing can be used within the implicit... 详细信息
来源: 评论
Putting declarative programming into the web: Translating curry to JavaScript  07
Putting declarative programming into the web: Translating cu...
收藏 引用
9th international ACM SIGPLAN conference on principles and practice of Declarative programming, PPDP'07
作者: Hanus, Michael Institut für Informatik CAU Kiel D-24098 Kiel Germany
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipulate complex data in a type-safe way, i... 详细信息
来源: 评论
Relational Database principles Consideration for SQL programming  9
Relational Database Principles Consideration for SQL Program...
收藏 引用
9th international conference on Engineering, Applied Sciences, and Technology, ICEAST 2023
作者: Pornphol, Putsadee Chittayasothorn, Suphamit Phuket Rajabhat University Faculty of Science and Technology Department of Digital Technology Phuket Thailand School of Information Technology King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand
In practice, SQL programmers often encounter queries which are hard to formulate using SQL statements. Many of them do not know if the queries are too hard beyond their capabilities, or they are the limitations of the... 详细信息
来源: 评论
Clique inference process for solving Max-CSP
Clique inference process for solving Max-CSP
收藏 引用
12th international conference on principles and practice of constraint programming (CP 2006)
作者: Khemmoudj, Mohand Ou Idir Bennaceur, Hachemi LIPN CNRS UMR 7030 F-93430 Villetaneuse France
In this paper we show that the clique concept can be exploited in order to solve Max-CSP. We present a clique inference process which leads to construct linear systems useful for computing new lower bounds. the clique... 详细信息
来源: 评论
Improvement of the Embarrassingly Parallel Search for Data Centers
Improvement of the Embarrassingly Parallel Search for Data C...
收藏 引用
20th international conference on the principles and practice of constraint programming (CP)
作者: Regin, Jean-Charles Rezgui, Mohamed Malapert, Arnaud Univ Nice Sophia Antipolis CNRS I3S UMR 7271 F-06900 Sophia Antipolis France
We propose an adaptation of the Embarrassingly Parallel Search (EPS) method for data centers. EPS is a simple but efficient method for parallel solving of CSPs. EPS decomposes the problem in many distinct subproblems ... 详细信息
来源: 评论
On Decomposing Knapsack constraints for Length-Lex Bounds Consistency
On Decomposing Knapsack Constraints for Length-Lex Bounds Co...
收藏 引用
15th international conference on principles and practice of constraint programming (CP 2009)
作者: Sellmann, Meinolf Brown Univ Dept Comp Sci Providence RI 02912 USA
the length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency for Knapsack constraints it has been... 详细信息
来源: 评论
Efficient Methods for constraint Acquisition  1
收藏 引用
24th international conference on the principles and practice of constraint programming (CP)
作者: Tsouros, Dimosthenis C. Stergiou, Kostas Sarigiannidis, Panagiotis G. Univ Western Macedonia Dept Informat & Telecommun Engn Kozani Greece
constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example... 详细信息
来源: 评论