找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Scalable Uncertainty Management; First International Henri Prade,V. S. Subrahmanian Conference proceedings 2007 Springer-Verlag Berlin Hei

[复制链接]
楼主: Ejaculation
发表于 2025-4-1 05:12:53 | 显示全部楼层
发表于 2025-4-1 06:47:17 | 显示全部楼层
Preferred Database Repairs Under Aggregate Constraints, is based on a transformation into an Integer Linear Programming (ILP) instance. Aggregate constraints are linear inequalities on aggregates retrieved from the input data. While strong constraints express mandatory conditions, weak constraints define conditions which are expected to be satisfied, ev
发表于 2025-4-1 13:37:10 | 显示全部楼层
发表于 2025-4-1 18:19:51 | 显示全部楼层
Learning from Imprecise Granular Data Using Trapezoidal Fuzzy Set Representations,implementing many operations involving trapezoidal fuzzy sets. Attention is particularly brought to the simplification that the linearity of the trapezoid brings in that it often allows us to perform operations on only two level sets. We investigate the classic learning algorithm in the case when ou
发表于 2025-4-1 19:06:55 | 显示全部楼层
Refining Aggregation Functions for Improving Document Ranking in Information Retrieval,en documents because some information is lost in this aggregation. To cope with this problem, the paper presents an approach for ranking documents in IR, based on a refined vector-based ordering technique taken from multiple criteria analysis methods. Different vector representations of the retrieva
发表于 2025-4-2 00:34:44 | 显示全部楼层
Finding Most Probable Worlds of Probabilistic Logic Programs,brahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.
发表于 2025-4-2 06:46:02 | 显示全部楼层
Learning Different User Profile Annotated Rules for Fuzzy Preference Top-k Querying,matic assignment of user model we design two algorithms, one for learning user preference on particular attribute and second for learning the combination function. Methods were integrated into a Fagin-like top-k querying system with some new heuristics and tested.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-9 23:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表