找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Recent Developments and the New Direction in Soft-Computing Foundations and Applications; Selected Papers from Shahnaz N. Shahbazova,Janusz

[复制链接]
楼主: GOLF
发表于 2025-3-28 18:19:49 | 显示全部楼层
发表于 2025-3-28 20:39:16 | 显示全部楼层
When Is Data Processing Under Interval and Fuzzy Uncertainty Feasible: What if Few Inputs Interact? unctions? In this paper, we show that the problem remains NP-hard if we use different formulas to describe the inputs’ interaction, and it becomes feasible if we only have . interacting inputs—but remains NP-hard if the number of inputs is . for any ..
发表于 2025-3-29 02:43:30 | 显示全部楼层
发表于 2025-3-29 06:18:48 | 显示全部楼层
A Probabilistic Fuzzy Table Lookup Scheme with Negation Logicis implemented on two classic function types, i.e. an increasing sinusoid and a pyramid step function, with fast versus slow changes as well as with few versus many observations. Results indicate the improved performance of the proposed PFTLSwNL by up to 60% at particularly higher noise levels.
发表于 2025-3-29 09:39:58 | 显示全部楼层
发表于 2025-3-29 13:11:19 | 显示全部楼层
发表于 2025-3-29 15:41:25 | 显示全部楼层
Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexityhe shape of this graph (e.g. the case with small sunflower leaves or the case with a restricted number of negative entries). Finally, we define a generalized quadratic form, called t-norm form, where the quadratic terms are replaced by t-norms. We prove that the optimization problem remains NP-hard with an . Lipschitz continuous t-norm.
发表于 2025-3-29 23:33:51 | 显示全部楼层
发表于 2025-3-30 02:24:47 | 显示全部楼层
发表于 2025-3-30 06:36:19 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-22 23:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表