找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: MFDBS 89; 2nd Symposium on Mat János Demetrovics,Bernhard Thalheim Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 Daten

[复制链接]
楼主: Wilson
发表于 2025-3-23 12:00:01 | 显示全部楼层
Multiple task selection protocol in a distributed problem solving network,lving network. These functions are used to specify the Multiple Task Selection Protocol which dynamically selects the most competent group of nodes for solving a problem and improves the problem solving capability of the network by making use of previous experience.
发表于 2025-3-23 16:18:46 | 显示全部楼层
发表于 2025-3-23 20:00:01 | 显示全部楼层
Selective refutation of integrity constraints in deductive databases, framework rather than providing convincing elements with respect to the advantages of the method. In order to get such an evidence examples that give rise to a more complex search spaces are needed..Much work has to be done to extend the approach to normal programs even if we foresee less advantages.
发表于 2025-3-23 23:30:50 | 显示全部楼层
发表于 2025-3-24 04:55:28 | 显示全部楼层
发表于 2025-3-24 08:10:31 | 显示全部楼层
An extended view on data base conceptual design,f Discourse?" by giving specific methods and algorithms. Some new operational concepts are introduced and studied: identifiers, identifier equivalence, special subuniverses, the relationship "A is genus proximus of B".
发表于 2025-3-24 12:04:27 | 显示全部楼层
发表于 2025-3-24 18:53:24 | 显示全部楼层
Restructuring and dependencies in databases,pendencies that generalize the functional ones are introduced. For these dependencies a sound and complete inference system D is constructed. Moreover, from the system D and the mapping ϕ a sound and complete inference system for the triple (ℜ, ϕ, .) is obtained.
发表于 2025-3-24 22:30:45 | 显示全部楼层
发表于 2025-3-25 02:46:41 | 显示全部楼层
A strategy for executing complex queries, is used; it allows us to maintain a join index, i.e. an index which permits to compute a join without operating on tuples coming from the two operand relations in it. The join index we propose can be used also when computing selections; we will show how it permits to perform operations on sets of pointers efficiently.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-24 06:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表