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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是901-910 订阅

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

详细简洁

排序：

Towards Effective ASP-based Stream Reasoning: Facilitate the Reasoning over Patterns of Events 24

Towards Effective ASP-based Stream Reasoning: Facilitate the...

引用

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

作者： Laboccetta, Luca Mastria, Elena Calimeri, Francesco Leone, Nicola Perri, Simona Terracina, Giorgio Univ Calabria Arcavacata Di Rende Italy DLVSystem Srl Arcavacata Di Rende Italy

ISBN: (纸本)9798400709692

In the latest years, Stream Reasoning (SR) has become increasingly relevant in various scenarios where it is required to reason over heterogeneous and highly dynamic data streams, typically along with large background knowledge bases, such as Smart Cities, IoT, Healthcare, etc. In this context, several solutions based on Answer Set programming (ASP) have been successfully employed. Nevertheless, real applications showed that it is often needed to deal with events over the timeline generating specific patterns that, in turn, can fire additional events or invalidate others. In this respect, current ASP-based state of the art systems appear not fully satisfactory, both from a modelling point of view and when it comes to usability and performance. In this work, starting from a well-established ASP-based SR solution, namely I-DLV-sr, we: (i) extend the language with means to explicitly define, identify and reason about patterns of events and their consequences, possibly spanning across the timeline;(ii) generalize the system architecture so that it is able to decouple language and implementation support from the choice of a specific ASP system, thus allowing the user to select the one best suited to the specific programming framework for Stream Reasoning. DP-sr is put to the test, showing both the ease in modelling and performance improvements.

关键词： Stream Reasoning Knowledge Representation and Reasoning Answer Set programming

来源：评论

学校读者我要写书评

暂无评论

Secure distributed constraint satisfaction: Reaching agreement without revealing private information 8th

引用

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

作者： Yokoo, Makoto Suzuki, Koutarou Hirayama, Katsutoshi NTT Communication Science Laboratories NTT Corporation 2-4 Hikaridai Seika-choKyoto619-0237 Japan NTT Information Sharing Platform Laboratories NTT Corporation 1-1 Hikari-no-oka YokosukaKanagawa239-0847 Japan Kobe University of Mercantile Marine 5-1-1 Fukae-minami-machi Higashinada-ku Kobe658-0022 Japan

ISBN: (纸本)3540441204

this paper develops a secure distributed constraint Satisfaction algorithm. A Distributed constraint Satisfaction Problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple agents. A major motivation for solving a DisCSP without gathering all information in one server is the concern about privacy/***, existing DisCSP algorithms leak some information during the search process and privacy/security issues are not dealt with *** newly developed algorithm utilizes a public key encryption *** this algorithm, multiple servers, which receive encrypted information from agents, cooperatively perform a search process that is equivalent to a standard chronological backtracking. this algorithm does not leak any private information, i.e., neither agents nor servers can obtain any additional information on the value assignment of variables that belong to other agents. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Answer set programming as a modeling language for course timetabling

Answer set programming as a modeling language for course tim...

引用

29th international conference on Logic programming ICLP

作者： Banbara, Mutsunori Soh, Takehide Tamura, Naoyuki Inoue, Katsumi Schaub, Torsten Kobe Univ Nada Ku Kobe Hyogo 6578501 Japan Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Univ Potsdam D-14482 Potsdam Germany

the course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. the modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.

关键词： answer set programming educational timetabling course timetabling

来源：评论

学校读者我要写书评

暂无评论

A global filtering algorithm for handling systems of quadratic equations and inequations 8th

引用

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

作者： Lebbah, Yahia Rueher, Michel Michel, Claude Université de Nice–Sophia Antipolis I3S–CNRS 930 route des Colles B.P. 145 Sophia Antipolis Cedex06903 France Université d’Oran Département d’Informatique Oran31000 Algeria

ISBN: (纸本)3540441204

this paper introduces a new filtering algorithm for handling systems of quadratic equations and inequations. Such constraints are widely used to model distance relations in numerous application areas ranging from robotics to chemistry. Classical filtering algorithms are based upon local consistencies and thus, are unable to achieve a significant pruning of the domains of the variables occurring in quadratic constraints systems. the drawback of these approaches comes from the fact that the constraints are handled independently. We introduce here a global filtering algorithm that works on a tight linear relaxation of the quadratic constraints. First experimentations show that this new algorithm yields a much more effective pruning of the domains than local consistency filtering algorithms. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Synthesis of search algorithms from high-level CP models

Synthesis of search algorithms from high-level CP models

引用

17th international conference on principles and practice of constraint programming, CP 2011

作者： Elsayed, Samir A. Mohamed Michel, Laurent Computer Science Department University of Connecticut United States

ISBN: (纸本)9783642237850

the ability to specify CP programs in terms of a declarative model and a search procedure is instrumental to the industrial CP successes. Yet, writing search procedures is often difficult for novices or people accustomed to model & run approaches. the viewpoint adopted in this paper argues for the synthesis of a search from the declarative model to exploit the problem instance structures. the intent is not to eliminate the search. Instead, it is to have a default that performs adequately in the majority of cases while retaining the ability to write full-fledged procedures. Empirical results demonstrate that the approach is viable, yielding procedures approaching and sometimes rivaling hand-crafted searches. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A constraint based agent for TAC-SCM

引用

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

作者： Burke, David A. Brown, Kenneth N. Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)3540292381

the annual international Trading Agent Competition-Supply Chain Management (TAC-SCM) game is based around the manufacture and supply of PCs. there are multiple agents in the game, scheduling production, competing for orders from customers and components from suppliers. A key decision to be made each day in the game is what offers should be made to customers. Each day, the agents receive a set of request for quotes (RFQ) from customers, agents respond with offers, and then the customers select the lowest bid. We have developed an agent to compete in the competition that combines constraint-based optimisation, reasoning with probabilities, and learning of market conditions in an attempt to determine what customer requests to bid on and what prices to bid. Our agent maintains prices that correspond to different probabilities of success in winning contracts, using an online learning approach. By keeping track of the ratio of offers accepted to those made, the prices can be updated iteratively to move closer to their target probability. this range of price/probability pairs is then used as input to a constraint model. For each request, the model chooses whether or not to bid, and selects a price from the range. these decisions are restricted by capacity and supply constraints. A capacity constraint ensures that we will be able to schedule any new orders we receive with existing orders such that the factory capacity for each day in the current horizon is not exceeded. the agents production ability is also subject to component availability, By ordering components in advance, we know the current amount of components available, and we also know how much of each component will be arriving at each clay. this allows us to add a constraint for availability of supplies. An objective function is specified that maximises our expected profit, where the profit on a request is calculated by subtracting from the selling price the cost of components together with late delivery penalties

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Suggestion strategies for constraint-based Matchmaker agents 4th

引用

4th international conference on principles and practice of constraint programming, CP 1998

作者： Freuder, Eugene C. Wallace, Richard J. University of New Hampshire DurhamNH03824 United States

ISBN: (纸本)3540652248

In this paper we describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition and satisfaction. Matchmaking agents are conceived as constraint- based solvers that interact with other, possibly human, agents (Customers). the Matchmaker provides potential solutions ("suggestions") based on partial knowledge, while gaining further information about the problem itself from the other agent through the latterߣs evaluation of these suggestions. the dialog between Matchmaker and Customer results in iterative improvement of solution quality, as demonstrated in simple simulations. We also show empirically that this paradigm supports "suggestion strategies" for finding acceptable solutions more efficiently or for increasing the amount of information obtained from the Customer. this work also indicates some ways in which the tradeoff between these two metrics for evaluating performance can be handled. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

the weighted average constraint

The weighted average constraint

引用

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

作者： Bonfietti, Alessio Lombardi, Michele DEIS University of Bologna Italy

ISBN: (纸本)9783642335570

Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or by operating on the search process. this approach fails to apply when the weights are decision variables and when the average value is part of a more complex expression. In this paper, we introduce a novel average constraint to provide a convenient model and efficient propagation for weighted average expressions appearing in a combinatorial model. this result is especially useful for Empirical Models extracted via Machine Learning (see [2]), which frequently count average expressions among their inputs. We provide basic and incremental filtering algorithms. the approach is tested on classical benchmarks from the OR literature and on a workload dispatching problem featuring an Empirical Model. In our experimentation the novel constraint, in particular with incremental filtering, proved to be even more efficient than traditional techniques to tackle weighted average expressions. © 2012 Springer-Verlag.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

SAT v CSP 6th

引用

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

作者： Walsh, Toby University of York York United Kingdom

ISBN: (纸本)3540410538

We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs)an d propositional satisfiability (SAT). We analyse four different mappings of SAT problems into CSPs, and two of CSPs into SAT problems. For each mapping, we compare the impact of achieving arc-consistency on the CSP with unit propagation on the SAT problem. We then extend these results to CSP algorithms that maintain (some level of)arc- consistency during search like FC and MAC, and to the Davis-Putnam procedure (which performs unit propagation at each search node). Because of differences in the branching structure of their search, a result showing the dominance of achieving arc-consistency on the CSP over unit propagation on the SAT problem does not necessarily translate to the dominance of MAC over the Davis- Putnam procedure. these results provide insight into the relationship between propositional satisfiability and constraint satisfaction. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9783642237850

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. Moreover, this capacity is not necessarily always the same during the scheduling period. this article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilím’s Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 87 88 89 90 91 92 93 94 95 96 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：