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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

60 篇 会议
29 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

41 篇 工学
- 39 篇 计算机科学与技术...
- 22 篇 软件工程
- 7 篇 电气工程
- 6 篇 信息与通信工程
- 1 篇 冶金工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
40 篇 理学
- 34 篇 数学
- 27 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

15 篇 constraint satis...
9 篇 constraint theor...
4 篇 logic programmin...
4 篇 semantics
2 篇 integer programm...
2 篇 empirical evalua...
2 篇 constraint progr...
2 篇 blocking pair
2 篇 computer program...
2 篇 constraint progr...
2 篇 polynomial-time ...
2 篇 most-stable matc...
2 篇 np-hardness
2 篇 job shop schedul...
1 篇 metals
1 篇 oracle coherence
1 篇 constraint logic...
1 篇 software enginee...
1 篇 java bytecode
1 篇 coverage testing

机构

3 篇 department of co...
2 篇 univ glasgow sch...
2 篇 department wni u...
2 篇 irst i38100 tren...
2 篇 department of co...
2 篇 department of co...
2 篇 inria rocquencou...
1 篇 computing scienc...
1 篇 university of ne...
1 篇 department of co...
1 篇 univ nice nice
1 篇 ntt communicatio...
1 篇 centre for resea...
1 篇 department of co...
1 篇 computer science...
1 篇 cert/onera 2 av....
1 篇 zuse inst berlin...
1 篇 laboratoire d’in...
1 篇 dept. of mathema...
1 篇 liens ecole norm...

作者

4 篇 walsh toby
4 篇 lee j.h.m.
4 篇 leung ho-fung
3 篇 gent ian p.
3 篇 rossi francesca
3 篇 frank jeremy
3 篇 macintyre ewan
2 篇 chmeiss assef
2 篇 prosser patrick
2 篇 tinelli cesare
2 篇 ruet paul
2 篇 cohen david
2 篇 harandi mehdi
2 篇 yonezawa akinori
2 篇 meisels amnon
2 篇 mcbride iain
2 篇 mello p.
2 篇 gudes ehud
2 篇 jeavons peter
2 篇 kepser stephan

语言

91 篇 英文

检索条件"任意字段=2nd International Conference on Principles and Practice of Constraint Programming, CP 1996"

共 91 条记录，以下是51-60 订阅

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

详细简洁

排序：

Local search and the number of solutions 2nd

Local search and the number of solutions

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Clark, David A. Frank, Jeremy Gent, Ian P. MacIntyre, Ewan Tomov, Neven Walsh, Toby Department of Computer Science University of Strathclyde GlasgowGl 1XH United Kingdom Department of Computer Science University of California at Davis DavisCA95616 United States Department of Computing and Electrical Engineering Heriot-Watt University EdinburghEH14 4AS United Kingdom IRST I38100 Trento and DIST GenovaI16145 Italy

ISBN: (纸本)3540615512

There has been considerable research interest into the solubility phase transition, and its effect on search cost for backtracking algorithms. In this paper we show that a similar easy-hard-easy pattern occurs for local search, with search cost peaking at the phase transition. This is despite problems beyond the phase transition having fewer solutions, which intuitively should make the problems harder to solve. We examine the relationship between search cost and number of solutions at different points across the phase transition, for three different local search procedures, across two problem classes (CSP and SAT). Our findings show that there is a significant correlation, which changes as we move through the phase transition. © Springer-Verlag Berlin Heidelberg 1996.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Using CSP look-back techniques to solve exceptionally hard SAT instances 2nd

Using CSP look-back techniques to solve exceptionally hard S...

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Bayardo, Roberto J. Schrag, Robert Dept. Of Computer Sciences and Applied Research Laboratories University of Texas at Austin Taylor Hall AustinTX78712 United States

ISBN: (纸本)3540615512

While CNF prepositional satisfiability (SAT) is a sub-class of the more general constraint satisfaction problem (CSP), conventional wisdom has it that some well-known CSP look-back techniques - including backjumping and learning — are of little use for SAT. We enhance the Tableau SAT algorithm of Crawford and Auton with look-back techniques and evaluate its performance on problems specifically designed to challenge it. The Random 3-SAT problem space has commonly been used to benchmark SAT algorithms because consistently difficult instances can be found near a region known as the phase transition. We modify Random 3-SAT in two ways which make instances even harder. First, we evaluate problems with structural regularities and find that CSP look-back techniques offer little advantage. Second, we evaluate problems in which a hard unsatisfiable instance of medium size is embedded in a larger instance, and we find the look-back enhancements to be indispensable. Without them, most instances are "exceptionally hard" -orders of magnitude harder than typical Random 3-SAT instances with the same surface characteristics. © Springer-Verlag Berlin Heidelberg 1996.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Logical semantics of concurrent constraint programming

引用

Lecture Notes in Computer Science 1996年 1118卷 397-397页

作者： Ruet, Paul

来源：评论

学校读者我要写书评

暂无评论

Combination of constraint systems II: Rational amalgamation 2nd

Combination of constraint systems II: Rational amalgamation

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Kepser, Stephan Schulz, Klaus U. CIS Universität München Oettingenstraße 67 Munchen80538 Germany

ISBN: (纸本)3540615512

In a recent paper2, the concept of "free amalgamation" has been introduced as a general methodology for interweaving solution structures for symbolic constraints, and it was shown how constraint solvers for two components can be lifted to a constraint solver for the free amalgam. Here we discuss a second general way for combining solution domains, called rational amalgamation. In praxis, rational amalgamation seems to be the preferred combination principle if the two solution structures to be combined are "rational" or "non-wellfounded" domains. It represents, e.g., the way how rational trees and rational lists are interwoven in the solution domain of Prolog III, and a variant has been used by W. Rounds for combining feature structures and hereditarily finite non-wellfounded sets. We show that rational amalgamation is a general combination principle, applicable to a large class of structures. As in the case of free amalgamation, constraint solvers for two component structures can be combined to a constraint solver for their rational amalgam. From this algorithmic point of view, rational amalgamation seems to be interesting since the combination technique for rational amalgamation avoids one source of non-determinism that is needed in the corresponding scheme for free amalgamation. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Metals

来源：评论

学校读者我要写书评

暂无评论

constraint logic programming over unions of constraint theories

引用

Lecture Notes in Computer Science 1996年 1118卷 436-436页

作者： Tinelli, Cesare Harandi, Mehdi

来源：评论

学校读者我要写书评

暂无评论

View of local search in constraint programming

引用

Lecture Notes in Computer Science 1996年 1118卷 353-353页

作者： Pesant, Gilles Gendreau, Michel

来源：评论

学校读者我要写书评

暂无评论

Experiences with combining constraint programming and discrete event simulation

引用

Lecture Notes in Computer Science 1996年 1118卷 543-543页

作者： Hellinck, Wim

来源：评论

学校读者我要写书评

暂无评论

constraint programming: An efficient and practical approach to solving the job-shop problem

引用

Lecture Notes in Computer Science 1996年 1118卷 149-149页

作者： Colombani, Yves

来源：评论

学校读者我要写书评

暂无评论

constraint satisfaction in optical routing for passive wavelength-routed networks 2nd

Constraint satisfaction in optical routing for passive wavel...

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Banerjee, Dhritiman Frank, Jeremy Department of Computer Science University of California Davis DavisCA95616 United States

ISBN: (纸本)3540615512

A wavelength-routed, optical network employs all-optical channels (lightpaths) on multiple wavelengths to establish a rearrangeable interconnection pattern (virtual topology)iax transport of data. A lightpath may span multiple fiber-links, and may be routed optically at an intermediate node without undergoing electronic conversion. We examine the problem of establishing a set of lightpaths in an optical network, which employs a passive wavelength routing device called a Latin Router (LR). Latin Routers are attractive for optical network design because of their fault-tolerance and low cost, but make traditional routing algorithms difficult to implement due to the complexity of the constraints they impose on legitimate routes and colors. We employ a local search algorithm to search the space of virtual topologies in order to satisfy a maximum number of given lightpath requests. We use the same algorithm to maximize the number of single-hop connections for a given network. We show that the algorithm can satisfy a high percentage of lightpaths under low to moderate network loads. Experiments reveal that we can establish 0(N) lightpaths in an optical network with N nodes. We believe that our work is the first known attempt at designing optical wide-area networks using Latin Routers. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

constraint databases

引用

Lecture Notes in Computer Science 1996年 1118卷 571-571页

作者： Goldin, Dina Q.

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：