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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

199 篇 期刊文献
95 篇 会议
3 篇 学位论文

馆藏范围

297 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

267 篇 工学
- 245 篇 计算机科学与技术...
- 105 篇 软件工程
- 29 篇 电气工程
- 25 篇 控制科学与工程
- 10 篇 信息与通信工程
- 6 篇 化学工程与技术
- 4 篇 机械工程
- 3 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 环境科学与工程（可...
- 2 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 城乡规划学
86 篇 理学
- 81 篇 数学
- 2 篇 生物学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 地理学
36 篇 管理学
- 32 篇 管理科学与工程(可...
- 8 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 经济学
- 7 篇 应用经济学
- 1 篇 理论经济学
5 篇 医学
- 4 篇 基础医学(可授医学...
3 篇 教育学
- 3 篇 教育学
1 篇 农学

主题

297 篇 constraint logic...
27 篇 mathematical pro...
17 篇 optimization
17 篇 scheduling
16 篇 logic programmin...
14 篇 program transfor...
11 篇 decision support
10 篇 program verifica...
8 篇 artificial intel...
8 篇 prolog
7 篇 clp
7 篇 constraint satis...
7 篇 symbolic executi...
6 篇 languages
6 篇 decision support...
6 篇 program analysis
6 篇 test case genera...
6 篇 abstract interpr...
6 篇 constraint solvi...
6 篇 constructive neg...

机构

8 篇 kielce univ tech...
6 篇 cnr iasi rome
6 篇 kielce univ tech...
5 篇 univ roma tor ve...
5 篇 univ craiova cra...
5 篇 new mexico state...
5 篇 univ udine dipar...
4 篇 kielce univ tech...
3 篇 univ pisa dipart...
3 篇 univ melbourne d...
3 篇 kielce univ tech...
3 篇 univ parma dipar...
3 篇 iasi cnr i-00185...
3 篇 carnegie mellon ...
3 篇 natl univ singap...
3 篇 imdea software i...
3 篇 g dannunzio univ...
3 篇 univ roma tor ve...
3 篇 univ parma dipar...
3 篇 tech univ gheorg...

作者

25 篇 sitek pawel
22 篇 wikarek jaroslaw
13 篇 proietti maurizi...
12 篇 pettorossi alber...
12 篇 fioravanti fabio
8 篇 de angelis emanu...
6 篇 badica amelia
6 篇 senni valerio
6 篇 mesnard fred
6 篇 badica costin
6 篇 rossi gianfranco
5 篇 cristia maximili...
4 篇 gavanelli marco
4 篇 stefanski tadeus...
4 篇 stuckey pj
4 篇 dovier agostino
4 篇 dovier a
4 篇 hermenegildo m
4 篇 pontelli enrico
4 篇 leon florin

语言

271 篇 英文
25 篇 其他
1 篇 德文

检索条件"主题词=CONSTRAINT LOGIC PROGRAMMING"

共 297 条记录，以下是231-240 订阅

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

详细简洁

排序：

CONTRACTIBILITY AND CONTRACTIBLE APPROXIMATIONS OF SOFT GLOBAL constraintS

CONTRACTIBILITY AND CONTRACTIBLE APPROXIMATIONS OF SOFT GLOB...

引用

26th International Conference on logic programming (ICLP)

作者： Maher, Michael J. Univ New South Wales NICTA Locked Bag 6016 Sydney NSW 1466 Australia Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

ISBN: (纸本)9783939897170

We study contractibility and its approximation for two very general classes of soft global constraints. We introduce a general formulation of decomposition-based soft constraints and provide a sufficient condition for contractibility and an approach to approximation. For edit-based soft constraints, we establish that the tightest contractible approximation cannot be expressed in edit-based terms, in general.

关键词： constraint logic programming global constraints open constraints soft constraints

来源：评论

学校读者我要写书评

暂无评论

Configuration Model of Employee Competences in a Social Media Team 1

引用

34th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE)

作者： Wikarek, Jaroslaw Sitek, Pawel Kielce Univ Technol Kielce Poland

ISBN: (数字)9783030794576

ISBN: (纸本)9783030794569;9783030794576

In the age of economics and knowledge-based economy, the competences of enterprises and organizations focus on the competences of their employees. It is especially visible in enterprises using advanced IT technologies and modern communication channels, such as social media. In recent years, social media has become an indispensable and very common channel of the business information flow, e.g., in the terms of advertising and marketing, payment processing, placing orders and tracking progress in their implementation. Thus, to support all these functionalities, usually in addition to specialized software and hardware, one needs highly qualified specialists, conventionally called the 'social media team'. This paper proposes a competency configuration model for the social media team. The presented model is the basis for supporting decisions in the selection, configuration, and optimization of the social media team in the context of the execution of a certain set of tasks. The implementation of the model using mathematical programming methods and a genetic algorithm with the original coding system for the modelled problem has also been proposed.

关键词： Social media team Resource allocation Decision support Mathematical programming Genetic algorithm constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

An architecture based on constraints for augmented shared workspaces 14

An architecture based on constraints for augmented shared wo...

引用

14th Brazilian Symposium on Computer Graphics and Image Processing

作者： Forster, CHQ Tozzi, CL Univ Estadual Campinas FEEC Sch Elect & Comp Engn DCADept Comp Engn & Ind Automat BR-13083970 Campinas SP Brazil

ISBN: (纸本)0769513301

Augmented shared workspaces are an instance of augmented reality which move the collaborative work from the desktop to the real workplace, enabling higher interaction level with coworkers and allowing implementation of advanced techniques of human-machine interfaces. In this paper, we advocate the employment of a constraint system as the document model (or program) for the implementation of augmented reality applications. We show that constraint technology is synergistic with augmented reality and collaborative work in many aspects. An architecture model based on agents and constraints is then proposed. Our point of view is supported by the observation of this technology being employed in Computer Graphics and Human-Computer Interaction research and the implementation of typical cases.

关键词： augmented reality constraint systems constraint logic programming shared workspaces CSCW multimedia document agent theory

来源：评论

学校读者我要写书评

暂无评论

A constraint-Based Mathematical Modeling Library in Prolog with Answer constraint Semantics 17th

A Constraint-Based Mathematical Modeling Library in Prolog w...

引用

17th International Symposium on Functional and logic programming (FLOPS)

作者： Fages, Francois Inria Saclay Palaiseau France

ISBN: (纸本)9789819722990;9789819723003

constraint logic programming emerged in the late 80's as a highly declarative class of programming languages based on first-order logic and theories with decidable constraint languages, thereby subsuming Prolog restricted to equality constraints over the Herbrand's term domain. This approach has proven extremely successful in solving combinatorial problems in the industry which quickly led to the development of a variety of constraint solving libraries in standard programming languages. Later came the design of a purely declarative front-end constraint-based modeling language, MiniZinc, independent of the constraint solvers, in order to compare their performances and create model benchmarks. Beyond that purpose, the use of a high-level modeling language such as MiniZinc to develop complete applications, or to teach constraint programming, is limited by the impossibility to program search strategies, or new constraint solvers, in a modeling language, as well as by the absence of an integrated development environment for both levels of constraint-based modeling and constraint solving. In this paper, we propose to solve those issues by taking Prolog with its constraint solving libraries, as a unified relation-based modeling and programming language. We present a Prolog library for high-level constraint-based mathematical modeling, inspired by MiniZinc, using subscripted variables (arrays) in addition to lists and terms, quantifiers and iterators in addition to recursion, together with a patch of constraint libraries in order to allow array functional notations in constraints. We show that this approach does not come with a significant computation time overhead, and presents several advantages in terms of the possibility of focussing on mathematical modeling, getting answer constraints in addition to ground solutions, programming search or constraint solvers if needed, and debugging models within a unique modeling and programming environment.

关键词： constraint logic programming algebraic modeling languages answer constraints MiniZinc meta-predicates constraint solving constraint simplification attributed variables ISO-Prolog

来源：评论

学校读者我要写书评

暂无评论

Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem

Declarative Representation and Solution of Vehicle Routing w...

引用

International Conference on Computational Science (ICCS)

作者： Badica, Amelia Badica, Costin Leon, Florin Luncean, Lucian Univ Craiova Craiova Romania Univ Gheorghe Asachi Iasi Iasi Romania Romanian German Univ Sibiu Sibiu Romania

Recently we have proposed a multi-agent system that provides an intelligent logistics brokerage service focusing on the transport activity for the efficient allocation of transport resources (vehicles or trucks) to the transport applications. The freight broker agent has a major role to coordinate transportation arrangements of transport customers (usually shippers and consignees) with transport resource providers or carriers, following the freight broker business model. We focus on the fundamental function of this business that aims to find available trucks and to define their feasible routes for transporting requested customer loads. The main contribution of this paper is on formulating our scheduling problem as a special type of vehicle routing with pickup and delivery problem. We propose a new set partitioning model of our specific problem. Vehicle routes are defined on the graph of cities, rather than on the graph of customer orders, as typically proposed by set partitioning formulations. This approach is particularly useful when a large number of customer orders sharing a significantly lower number of pickup and delivery points must be scheduled. Our achievement is the declarative representation and solution of the model using ECLiPSe state-of-the-art constraint logic programming system. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： constraint logic programming vehicle routing pickup and delivery problem

来源：评论

学校读者我要写书评

暂无评论

Semi-dynamic demand in a non-permutation flowshop with constrained resequencing buffers

引用

6th International Conference on Large-Scale Scientific Computing (LSSC 2007)

作者： Faerber, Gerrit Salhi, Said Coves Moreno, Anna M. Univ Politecn Cataluna Inst Org Control Sistemes Ind Barcelona Spain Univ Kent Kent Business Sch Ctr Heurist Optimisat Canterbury Kent England

ISBN: (纸本)9783540788256

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using constraint logic programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.

关键词： semi-dynamic demand constraint logic programming genetic algorithm non-permutation flowshop mixed model assembly line

来源：评论

学校读者我要写书评

暂无评论

Model-based protocol log generation for testing a telecommunication test harness using CLP

Model-based protocol log generation for testing a telecommun...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Balck, Kenneth Grinchtein, Olga Pearson, Justin Ericsson AB Linkoping Sweden Ericsson AB Stockholm Sweden Uppsala Univ Dept Informat Technol Uppsala Sweden

ISBN: (纸本)9783981537024

Within telecommunications development it is vital to have frameworks and systems to replay complicated scenarios on equipment under test, often there are not enough available scenarios. In this paper we study the problem of testing a test harness, which replays scenarios and analyses protocol logs for the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard. Protocol logs are sequences of messages with timestamps;and are generated by different mobile network entities. In our case study we focus on user equipment protocol logs. In order to test the test harness we require that logs have both incorrect and correct behaviour. It is easy to collect logs from real system runs, but these logs do not show much variation in the behaviour of system under test. We present an approach where we use constraint logic programming (CLP) for both modelling and test generation, where each test case is a protocol log. In this case study, we uncovered previously unknown faults in the test harness.

关键词： 4G mobile communication Long Term Evolution logic programming protocols telecommunication computing telecommunication equipment testing CLP LTE 4G standard Long Term Evolution 4G standard constraint logic programming equipment-under-test message sequences mobile network entities model-based protocol log generation public warning system service system-under-test telecommunication development telecommunication test harness test generation timestamps user equipment protocol logs Alarm systems Computer architecture Long Term Evolution Mathematical model programming Protocols Testing

来源：评论

学校读者我要写书评

暂无评论

An Assertion Language for Slicing constraint logic Languages 28th

An Assertion Language for Slicing Constraint Logic Languages

引用

28th International Symposium on logic-Based Program Synthesis and Transformation (LOPSTR(

作者： Falaschi, Moreno Olarte, Carlos Univ Siena Dept Informat Engn & Math Siena Italy Univ Fed Rio Grande do Norte ECT Natal RN Brazil

ISBN: (纸本)9783030138387;9783030138370

constraint logic programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent constraint programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store. In a previous paper, we developed a framework for dynamic slicing of CCP where the user first identifies that a (partial) computation is wrong. Then, she marks (selects) some parts of the final state corresponding to the data (constraints) and processes that she wants to study more deeply. An automatic process of slicing begins, and the partial computation is "depurated" by removing irrelevant information. In this paper we give two major contributions. First, we extend the framework to CLP, thus generalizing the previous work. Second, we provide an assertion language suitable for both, CCP and CLP, which allows the user to specify some properties of the computations in her program. If a state in a computation does not satisfy an assertion then some "wrong" information is identified and an automatic slicing process can start. We thus make one step further towards automatizing the slicing process. We show that our framework can be integrated with the previous semi-automatic one, giving the user more choices and flexibility. We show by means of examples and experiments the usefulness of our approach.

关键词： Concurrent constraint programming constraint logic programming Dynamic slicing Debugging Assertion language

来源：评论

学校读者我要写书评

暂无评论

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

A hybrid MILP/CLP algorithm for multipurpose batch process s...

引用

14th European Symposium on Computer Aided Process Engineering (ESCAPE-14)

作者： Roe, B Papageorgiou, LG Shah, N Univ London Imperial Coll Sci Technol & Med Ctr Proc Syst Engn Dept Chem Engn London SW7 2AZ England UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

This paper presents a novel hybrid constraint logic programming (CLP) and MILP algorithm for scheduling complex multipurpose batch processes. The scheduling problem is decomposed into two sub-problems: first an aggregate planning problem is solved using an MILP model, and then a sequencing problem is solved using CLP techniques. The CLP model avoids the complexity of explicitly stating complete material balance constraints by instead using precedence constraints between batches to ensure the schedule is feasible. The efficiency of the algorithm is demonstrated with four examples and areas for future improvement are identified. (c) 2005 Published by Elsevier Ltd.

关键词： MlLP/CLP algorithm constraint logic programming process scheduling

来源：评论

学校读者我要写书评

暂无评论

An Improved logic-Based Implementation to Ontology Assessment 6

An Improved Logic-Based Implementation to Ontology Assessmen...

引用

6th Brazilian Conference on Intelligent Systems (BRACIS)

作者： de Oliveira Rodrigues, Cleyton Mario Goncalves de Freitas, Frederico Luiz de Azevedo, Ryan Ribeiro Univ Pernambuco UPE Garanhuns PE Brazil Univ Fed Pernambuco CIn POB 7851 Recife PE Brazil Univ Fed Rural Pernambuco Garanhuns PE Brazil

ISBN: (纸本)9781538624074

With the advent of the Semantic Web, ontology engineering has produced thousands of conceptual models. In this context, ontological evaluation is a crucial and imperative task, enabling reuse and the models' evolution. Several frameworks have been proposed in the literature for quality and correctness assessment as OntoClean, a very subjective methodology based on the user's knowledge to ascertain meta properties to the concepts of ontology, in order to find out disparities with respect the real domain. Unfortunately, OntoClean only applies to Ontologies whose concepts were completely labeled by the user. Due to the lack of stable OntoClean implementations and the imposed limitation, this paper presents an implementation in a general constraint logic-based language, which is still useful to partially labeled ontologies. At the end, some of scalability and efficiency tests are demonstrated.

关键词： constraint logic programming Knowledge Representation Ontology Evaluation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：