检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

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 条记录，以下是931-940 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Improved algorithms for the global cardinality constraint

引用

10th international conference on principles and practice of constraint programming, CP 2004

作者： Quimper, Claude-Guy López-Ortiz, Alejandro Van Beek, Peter Golynski, Alexander University of Waterloo Waterloo Canada

ISBN: (纸本)3540232419

We study the global cardinality constraint (gcc) and propose an O(n1.5d) algorithm for domain consistency and an O(cn + dn) algorithm for range consistency where n is the number of variables, d the number of values in the domain, and c an output dependent variable smaller than or equal to n. We show how to prune the cardinality variables in O(n2d + n2.66) steps, detect if gcc is universal in constant time and prove that it is NP-Hard to maintain domain consistency on extended-GCC. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set programming 29

Efficient Enumeration of Fixed Points in Complex Boolean Net...

引用

29th international conference on principles and practice of constraint programming, CP 2023

作者： Trinh, Van-Giang Benhamou, Belaid Soliman, Sylvain LIS Aix-Marseille University Marseille France Lifeware team Inria Saclay Palaiseau France

ISBN: (纸本)9783959773003

Boolean Networks (BNs) are an efficient modeling formalism with applications in various research fields such as mathematics, computer science, and more recently systems biology. One crucial problem in the BN research is to enumerate all fixed points, which has been proven crucial in the analysis and control of biological systems. Indeed, in that field, BNs originated from the pioneering work of R. thomas on gene regulation and from the start were characterized by their asymptotic behavior: complex attractors and fixed points. the former being notably more difficult to compute exactly, and specific to certain biological systems, the computation of stable states (fixed points) has been the standard way to analyze those BNs for years. However, with the increase in model size and complexity of Boolean update functions, the existing methods for this problem show their limitations. To our knowledge, the most efficient state-of-the-art methods for the fixed point enumeration problem rely on Answer Set programming (ASP). Motivated by these facts, in this work we propose two new efficient ASP-based methods to solve this problem. We evaluate them on both real-world and pseudo-random models, showing that they vastly outperform four state-of-the-art methods as well as can handle very large and complex models. © Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman.

关键词： Biological systems

来源：评论

学校读者我要写书评

暂无评论

New tractable classes from old 6th

引用

6th international conference on principles and practice of constraint programming, CP2000

作者： Cohen, David Jeavons, Peter Gault, Richard Department of Computer Science Royal Holloway University of London United Kingdom Oxford University Computing Laboratory Wolfson Building Parks Road Oxford United Kingdom

ISBN: (纸本)3540410538

Many combinatorial problems can be naturally expressed as "constraint satisfaction problems". this class of problems is known to be NP-hard in general, but a number of restrictions of the general problem have been identified which ensure tractability. this paper introduces a method of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Symmetry breaking constraints for value symmetries in constraint satisfaction

Symmetry breaking constraints for value symmetries in constr...

引用

11th international conference on principles and practice of constraint programming (CP 2005)

作者： Law, Y. C. Lee, J. H. M. Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, symmetry breaking constraints are commonly used. While variable symmetry breaking constraints can be expressed easily and propagated efficiently using lexicographic ordering, value symmetry breaking constraints are often difficult to formulate. In this paper, we propose two methods of using symmetry breaking constraints to tackle value symmetries. First, we show theoretically when value symmetries in one CSP correspond to variable symmetries in another CSP of the same problem. We also show when variable symmetry breaking constraints in the two CSPs, combined using channeling constraints, are consistent. Such results allow us to tackle value symmetries efficiently using additional CSP variables and channeling constraints. Second, we introduce value precedence, a notion which can be used to break a common class of value symmetries, namely symmetries of indistinguishable values. While value precedence can be expressed using inefficient if-then constraints in existing CSP solvers, we propose efficient propagation algorithms for implementing global value precedence constraints. We also characterize several theoretical properties of the value precedence constraints. Extensive experiments are conducted to verify the feasibility and efficiency of the two proposals.

关键词： symmetry breaking value symmetries constraint satisfaction

来源：评论

学校读者我要写书评

暂无评论

Higher-Order unification for free! Reusing the meta-language unification for the object language 24

Higher-Order unification for free! Reusing the meta-language...

引用

26th international conference on principles and practice of Declarative programming (PPDP)

作者： Fissore, Davide Tassi, Enrico Univ Cote Azur Inria Valbonne France

ISBN: (纸本)9798400709692

Specifying and implementing a proof system from scratch requires significant effort. Logical Frameworks and Higher Order Logic programming Languages provide dedicated, high-level meta languages to facilitate this task in two ways: 1) variable binding and substitution are for free when meta language binders represent object logic ones;2) proof construction, and proof search, are greatly simplified by leveraging the unification procedure provided by the meta language. Notable examples of meta languages are Elf [21], Twelf [23], lambda Prolog [16], Beluga [24], Abella [8] and Isabelle [31] which have been used to implement or specify many formal systems such as First Order Logic [5], Set theory [20], Higher Order Logic [19], and the Calculus of Constructions [4]. the object logic we are interested in is Coq's type theory [28]. We aim to develop a higher-order unification-based proof search procedure using the meta language Elpi [3], a dialect of lambda Prolog. Elpi's equational theory includes beta eta-equivalence and features a higher-order unification procedure similar or equal to(m) for the pattern fragment [15]. Elpi offers an encoding of Coq terms that is suitable for meta programming [6, 9, 26, 27] but that restricts similar or equal to(m) to first-order unification problems only. We refer to this basic encoding as O. In this paper we translate unification problems in O to an alternative encoding called M, from which we derive similar or equal to(O), the higher-order unification procedure of O. similar or equal to(O) honours beta eta-equivalence for terms within the pattern fragment, and allows for the use of heuristics when the terms fall outside the pattern fragment. Moreover, as similar or equal to(O) delegates most of the work to similar or equal to(m), it can be used to efficiently simulate a logic program in O by taking advantage of unification-related optimizations of the meta language, such as clause indexing.

关键词： Logic programming Meta-programming Higher-Order Unification

来源：评论

学校读者我要写书评

暂无评论

Temporal planning through mixed integer programming: A preliminary report 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Dimopoulos, Yannis Gerevini, Alfonso Department of Computer Science University of Cyprus P.O Box 20537 NicosiaCY-1678 Cyprus DEA – Universitá degli Studi di Brescia Via Branze 38 BresciaI-25123 Italy

ISBN: (纸本)3540441204

Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. this paper presents a novel approach to temporal planning that is based on Mixed Integer programming. In the new framework, a temporal planning domain is modeled by two sets of linear inequalities. the first set involves integer variables and is a Graphplan-like encoding of a simplification of the original problem where the duration of the actions is ignored. the second set involves both integer and real valued variables, and models the temporal aspects of the problem. the two sets interact through the common integer variables, and their combination can be solved by using available Mixed Integer programming software. the new method aims at generating good solutions quickly, under different minimization *** experimental results illustrate the effectiveness of our approach. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid paradigm for adaptive parallel search

A hybrid paradigm for adaptive parallel search

引用

18th international conference on principles and practice of constraint programming, CP 2012

作者： Yun, Xi Epstein, Susan L. Department of Computer Science Graduate Center City University of New York New York NY 10016 United States Department of Computer Science Hunter College City University of New York New York NY 10065 United States

ISBN: (纸本)9783642335570

Parallelization offers the opportunity to accelerate search on constraint satisfaction problems. To parallelize a sequential solver under a popular message passing protocol, the new paradigm described here combines portfolio-based methods and search space splitting. To split effectively and to balance processor workload, this paradigm adaptively exploits knowledge acquired during search and allocates additional resources to the most difficult parts of a problem. Extensive experiments in a parallel environment show that this paradigm significantly improves the performance of an underlying sequential solver, outperforms more naive approaches to parallelization, and solves many difficult problems left open after recent solver competitions. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A framework for constructing peer-to-peer overlay networks in java 09

A framework for constructing peer-to-peer overlay networks i...

引用

7th international conference on principles and practice of programming in Java, PPPJ 2009

作者： Rui, Shen Ji, Wang Shengdong, Zhang Siqi, Shen Pei, Fan National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Computing University of Leeds Leeds LS2 9JT United Kingdom

ISBN: (纸本)9781605585987

Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide key-based routing capabilities to eliminate flooding in unstructured ones. Many overlay network protocols have been proposed to organize peers into various topologies with emphasis on different networking properties. However, applications are often stuck to a specific peer-to-peer overlay network implementation, because different overlay implementations usually provide very different interfaces and messaging mechanisms. In this paper, we present a framework for constructing peer-to-peer overlay networks in Java. First, networking is abstracted by the interfaces that use URIs to uniformly address peers on different underlying or overlay networks. then, asynchronous and synchronous messaging support is built upon these interfaces. Finally, overlay networking interfaces are sketched to handle specific issues in overlay networks. We have constructed several overlay networks in this framework, and built peer-to-peer applications which are independent of overlay implementations. Copyright 2009 ACM.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

constraint generation via automated theory formation 7

引用

7th international conference on principles and practice of constraint programming, CP 2001

作者： Colton, Simon Miguel, Ian Division of Informatics University of Edinburgh 80 South Bridge EdinburghEH1 1HN United Kingdom Department of Computer Science University of York Heslington YorkYO10 5DD United Kingdom

ISBN: (纸本)3540428631

Adding constraints to a basic CSP model can significantly reduce search,e.g. for Golomb rulers [6]. the generation process is usually performed by hand, although some recent work has focused on automatically generating symmetry breaking constraints [4]and (less so)on generating implied constraints [5]. We describe an approach to generating implied,symmetry breaking and specialisation constraints and apply this technique to quasigroup construction [10].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Streamlined constraint reasoning

引用

10th international conference on principles and practice of constraint programming, CP 2004

作者： Gomes, Carla P. Sellmann, Meinolf Cornell University Department of Computer Science 4130 Upson Hall IthacaNY14853 United States

ISBN: (纸本)3540232419

We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search first towards a small and structured combinatorial subspace. the streamlining constraints capture regularities observed in a subset of the solutions to smaller problem instances. We demonstrate the effectiveness of our approach by solving a number of hard combinatorial design problems. Our experiments show that streamlining scales significantly beyond previous approaches. © Springer-Verlag Berlin Heidelberg 2004.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共108页 << < 90 91 92 93 94 95 96 97 98 99 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：