標題: Titlebook: Decision Making under Constraints; Martine Ceberio,Vladik Kreinovich Book 2020 Springer Nature Switzerland AG 2020 Computational Intellige [打印本頁] 作者: BRISK 時間: 2025-3-21 19:18
書目名稱Decision Making under Constraints影響因子(影響力)
書目名稱Decision Making under Constraints影響因子(影響力)學科排名
書目名稱Decision Making under Constraints網(wǎng)絡(luò)公開度
書目名稱Decision Making under Constraints網(wǎng)絡(luò)公開度學科排名
書目名稱Decision Making under Constraints被引頻次
書目名稱Decision Making under Constraints被引頻次學科排名
書目名稱Decision Making under Constraints年度引用
書目名稱Decision Making under Constraints年度引用學科排名
書目名稱Decision Making under Constraints讀者反饋
書目名稱Decision Making under Constraints讀者反饋學科排名
作者: 無法解釋 時間: 2025-3-21 21:50
How Neural Networks (NN) Can (Hopefully) Learn Faster by Taking into Account Known Constraints,. The major reason why learning in neural networks is slow is that neural networks are currently unable to take prior knowledge into account. As a result, they simply ignore this knowledge and simulate learning “from scratch”. In this paper, we show how neural networks can take prior knowledge into account and thus, hopefully, learn faster.作者: lipids 時間: 2025-3-22 01:39
Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable,gorithms traditionally used by their ethnic group—or simply to their sense of curiosity. Somewhat surprisingly, we show that one of these algorithms—a traditional Italian multiplication algorithm—is actually in some reasonable sense better than the algorithm that we all normally use—namely, it is easier to parallelize.作者: Orgasm 時間: 2025-3-22 06:37
Reverse Mathematics Is Computable for Interval Computations,y the given system. In this paper, we show that while we cannot always exactly describe this set, it is possible to have a general algorithm that, given ., provides an .-approximation to the desired solution set.作者: EXUDE 時間: 2025-3-22 10:49 作者: Peak-Bone-Mass 時間: 2025-3-22 16:50 作者: Peak-Bone-Mass 時間: 2025-3-22 20:53
Why Decimal System and Binary System Are the Most Widely Used: A Possible Explanation,, its sides are almost exactly 7/10, and when we want to construct a cube of half volume its sides are almost exactly 8/10. In this paper, we show that 2, 4, and 10 are the only numbers with this property—at least among the first billion numbers. This may be a possible explanation of why decimal and binary systems are the most widely used.作者: fibroblast 時間: 2025-3-22 21:55 作者: 全國性 時間: 2025-3-23 02:21
Database and Expert Systems Applicationsy changing circumstances is often not a good idea, the existence of a pre-computed original plan enables us to produce an almost-optimal strategy—a strategy that would have been computationally difficult to produce on a short notice without the pre-existing plan.作者: 有法律效應(yīng) 時間: 2025-3-23 06:13 作者: flavonoids 時間: 2025-3-23 11:04 作者: RENIN 時間: 2025-3-23 17:18 作者: 清晰 時間: 2025-3-23 19:35 作者: 外來 時間: 2025-3-24 00:31
,Plans Are Worthless but Planning Is Everything: A Theoretical Explanation of Eisenhower’s Observatiy changing circumstances is often not a good idea, the existence of a pre-computed original plan enables us to produce an almost-optimal strategy—a strategy that would have been computationally difficult to produce on a short notice without the pre-existing plan.作者: LIEN 時間: 2025-3-24 03:56
Why Convex Optimization Is Ubiquitous and Why Pessimism Is Widely Spread,about human decision making. This explanation also helps us explain why in decision making under uncertainty, people often make pessimistic decisions, i.e., decisions based more on the worst-case scenarios.作者: CYT 時間: 2025-3-24 10:19 作者: 燈絲 時間: 2025-3-24 12:27
Using Constraint Propagation for Cooperative UAV Localization from Vision and Ranging, measurements, by using set inversion via interval analysis?(Moore in Interval analysis. Prentice Hall, 1966 [.]). Then, through position boxes exchange, positions are cooperatively refined by constraint propagation in the group. Results are presented with real robot data, and show position accuracy improvement thanks to cooperation.作者: 中和 時間: 2025-3-24 17:07 作者: PHONE 時間: 2025-3-24 22:01
Shangpu Jiang,Daniel Lowd,Dejing Dou. The major reason why learning in neural networks is slow is that neural networks are currently unable to take prior knowledge into account. As a result, they simply ignore this knowledge and simulate learning “from scratch”. In this paper, we show how neural networks can take prior knowledge into account and thus, hopefully, learn faster.作者: mastoid-bone 時間: 2025-3-24 23:39 作者: grenade 時間: 2025-3-25 03:28 作者: GUISE 時間: 2025-3-25 10:56 作者: BLOT 時間: 2025-3-25 14:33
Wojciech Macyna,Michal Kukowskingly, for global maxima, the situation is different: even if we only know the number of locations where the . maximum is attained, then, in general, it is not algorithmically possible to find all these locations. A similar impossibility result holds for local maxima if instead of knowing their exact number, we only know two possible numbers.作者: separate 時間: 2025-3-25 17:38 作者: 吝嗇性 時間: 2025-3-25 21:40
Lecture Notes in Computer Sciencether, we propose the notion of nondeterministic fuzzy specifications (NFSs) to specify the behavior of NFDESs and introduce a satisfaction relation between NFDESs and NFSs. If such a relation exists, then at least one knows that there is no unwanted behavior in the system.作者: Bereavement 時間: 2025-3-26 02:38 作者: 節(jié)省 時間: 2025-3-26 05:27 作者: Urea508 時間: 2025-3-26 09:46
Fuzzy Systems Are Universal Approximators for Random Dependencies: A Simplified Proof,alues . with different probabilities. It has been proven that fuzzy systems are universal approximators for such random dependencies as well. However, the existing proofs are very complicated and not intuitive. In this paper, we provide a simplified proof of this universal approximation property.作者: right-atrium 時間: 2025-3-26 14:26
Book 2020e annual International Workshops on Constraint Programming and Decision Making focus on cross-fertilization between different areas, attracting researchers and practitioners from around the globe. The book includes numerous papers describing applications, in particular, applications to engineering, 作者: 完成才會征服 時間: 2025-3-26 20:14 作者: 玉米棒子 時間: 2025-3-26 22:08
Lecture Notes in Computer Science the Dupire formula. Dupire continues the Black Scholes Merton model (BSM), but addresses the weakness of the volatility in the model. By observing volatility as a function of time, Dupire removes the predictable volatility smile found in the BSM model. We optimize this volatility to minimize the ri作者: 起皺紋 時間: 2025-3-27 03:27
2198-4182 oss-fertilization between different areas, attracting researchers and practitioners from around the globe. The book includes numerous papers describing applications, in particular, applications to engineering, 978-3-030-40816-9978-3-030-40814-5Series ISSN 2198-4182 Series E-ISSN 2198-4190 作者: 小淡水魚 時間: 2025-3-27 08:32
Fuzzy Systems Are Universal Approximators for Random Dependencies: A Simplified Proof,s dependence. These rules are often described by using imprecise (“fuzzy”) words from natural language. Fuzzy techniques have been invented with the purpose to translate these rules into a precise dependence .. For deterministic dependencies ., there are universal approximation results according to 作者: insincerity 時間: 2025-3-27 12:04
How Quantum Computing Can Help with (Continuous) Optimization,much smaller quantum computation time .. In this paper, we show that for a continuous optimization problem, with quantum computing, we can reach almost the same speed-up: namely, we can reduce the non-quantum time . to a much shorter quantum computation time ..作者: ATRIA 時間: 2025-3-27 17:02 作者: Militia 時間: 2025-3-27 21:09 作者: 金盤是高原 時間: 2025-3-27 23:38 作者: Hyaluronic-Acid 時間: 2025-3-28 02:57 作者: incredulity 時間: 2025-3-28 06:34
Reverse Mathematics Is Computable for Interval Computations,this system. Reverse mathematics means finding necessary and sufficient conditions, i.e., in this case, describing the set of . the points that satisfy the given system. In this paper, we show that while we cannot always exactly describe this set, it is possible to have a general algorithm that, giv作者: ironic 時間: 2025-3-28 14:16
,Plans Are Worthless but Planning Is Everything: A Theoretical Explanation of Eisenhower’s Observatiuring the Second World War taught him that “plans are worthless, but planning is everything”. This sound contradictory: if plans are worthless, why bother with planning at all? In this paper, we show that Eisenhower’s observation has a meaning: while directly following the original plan in constantl作者: STAT 時間: 2025-3-28 15:45 作者: 陰郁 時間: 2025-3-28 18:47
Probabilistic Fuzzy Neural Networks and Interval Arithmetic Techniques for Forecasting Equities,al network (PFNN) (developed by Han-Xiong Li and Zhi Liu), we are able to handle complex stochastic uncertainties. In light of the Black Scholes Merton model, we use triangular fuzzy numbers in its calculaltion to include the range instead of a spot price for an investment. Stock market forecasting 作者: 古代 時間: 2025-3-29 00:49 作者: Prostatism 時間: 2025-3-29 03:09
Thick Separators,pped with the inclusion . as an order relation. It can generally be defined by parameters or functions which are not known exactly, but are known to belong to some intervals. In this paper, we show how to use constraint propagation methods in order to compute efficiently an inner and an outer approx作者: 全神貫注于 時間: 2025-3-29 09:54 作者: AMPLE 時間: 2025-3-29 15:19
Attraction-Repulsion Forces Between Biological Cells: A Theoretical Explanation of Empirical Formul attract. There are empirical formulas that describe the dependence of the corresponding forces on the distance between the cells. In this paper, we provide a theoretical explanation for these empirical formulas.作者: 眨眼 時間: 2025-3-29 17:29
When We Know the Number of Local Maxima, Then We Can Compute All of Them, the locations of all its local maxima. We show, however, that if we know the . of local maxima, then such an algorithm is already possible. Interestingly, for global maxima, the situation is different: even if we only know the number of locations where the . maximum is attained, then, in general, i作者: GEAR 時間: 2025-3-29 23:32
Why Decimal System and Binary System Are the Most Widely Used: A Possible Explanation,t with a unit interval and we want to construct an interval of half width, then this width is exactly 5/10; when we want to find a square of half area, its sides are almost exactly 7/10, and when we want to construct a cube of half volume its sides are almost exactly 8/10. In this paper, we show tha作者: 名詞 時間: 2025-3-30 02:32 作者: SCORE 時間: 2025-3-30 04:22
Ontology Matching with Knowledge Rulesmuch smaller quantum computation time .. In this paper, we show that for a continuous optimization problem, with quantum computing, we can reach almost the same speed-up: namely, we can reduce the non-quantum time . to a much shorter quantum computation time ..作者: 按時間順序 時間: 2025-3-30 08:24
Sven Hartmann,Josef Küng,Ismail Khalil attract. There are empirical formulas that describe the dependence of the corresponding forces on the distance between the cells. In this paper, we provide a theoretical explanation for these empirical formulas.作者: 制定 時間: 2025-3-30 12:49
https://doi.org/10.1007/978-3-030-40814-5Computational Intelligence; Constraint Programming; Decision Making; Decision Making Under Constraints; 作者: 變態(tài) 時間: 2025-3-30 18:10
978-3-030-40816-9Springer Nature Switzerland AG 2020作者: 夾克怕包裹 時間: 2025-3-30 21:21
Huiying Li,Yuanyuan Li,Feifei Xu,Xinyu ZhongThis paper is an investigation about primeness in quantales environment. It is proposed a new definition for prime ideal in noncommutative setting. As a consequence, fuzzy primeness can be defined in similar way to ring theory.作者: 泥土謙卑 時間: 2025-3-31 04:14
Lecture Notes in Computer ScienceIn this contribution, we propose an ordinal sum construction of t-norms on bounded lattices from a system of lattices (endowed by t-norms) whose index set forms a bounded lattice. The ordinal sum construction is determined by a lattice-based sum of bounded lattices and interior operators.作者: 一再困擾 時間: 2025-3-31 08:26
Paola Gómez,Rubby Casallas,Claudia RoncancioThis chapter shows a comparison of several t-norms and t-conorms used to compute the steady state of a fuzzy Markov chain. The effect of every of the selected norms over the mean and variance of a fuzzy Markov chain is evaluated using some simulations. Some recommendations and concluding remarks are given.作者: JADED 時間: 2025-3-31 11:45 作者: 大炮 時間: 2025-3-31 15:30 作者: 節(jié)省 時間: 2025-3-31 19:07 作者: 外露 時間: 2025-4-1 01:00
How Quantum Computing Can Help with (Continuous) Optimization,much smaller quantum computation time .. In this paper, we show that for a continuous optimization problem, with quantum computing, we can reach almost the same speed-up: namely, we can reduce the non-quantum time . to a much shorter quantum computation time ..作者: Resistance 時間: 2025-4-1 03:22 作者: 潰爛 時間: 2025-4-1 06:04 作者: 強所 時間: 2025-4-1 12:45
Studies in Systems, Decision and Controlhttp://image.papertrans.cn/d/image/264239.jpg作者: exclamation 時間: 2025-4-1 14:23 作者: 聯(lián)合 時間: 2025-4-1 22:20
Ontology Matching with Knowledge Rulesmuch smaller quantum computation time .. In this paper, we show that for a continuous optimization problem, with quantum computing, we can reach almost the same speed-up: namely, we can reduce the non-quantum time . to a much shorter quantum computation time ..作者: 六個才偏離 時間: 2025-4-1 22:45 作者: 不成比例 時間: 2025-4-2 06:46 作者: Lignans 時間: 2025-4-2 07:13
