標題: Titlebook: Mathematical Optimization Theory and Operations Research; 22nd International C Michael Khachay,Yury Kochetov,Panos Pardalos Conference proc [打印本頁] 作者: 空隙 時間: 2025-3-21 19:56
書目名稱Mathematical Optimization Theory and Operations Research影響因子(影響力)
書目名稱Mathematical Optimization Theory and Operations Research影響因子(影響力)學(xué)科排名
書目名稱Mathematical Optimization Theory and Operations Research網(wǎng)絡(luò)公開度
書目名稱Mathematical Optimization Theory and Operations Research網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Optimization Theory and Operations Research被引頻次
書目名稱Mathematical Optimization Theory and Operations Research被引頻次學(xué)科排名
書目名稱Mathematical Optimization Theory and Operations Research年度引用
書目名稱Mathematical Optimization Theory and Operations Research年度引用學(xué)科排名
書目名稱Mathematical Optimization Theory and Operations Research讀者反饋
書目名稱Mathematical Optimization Theory and Operations Research讀者反饋學(xué)科排名
作者: entrance 時間: 2025-3-21 22:27
res (Guhn et al., J Educ Psychol 112:308–328, .). This chapter also examines how participatory music education increases child wellbeing and strengthens their sense of social cohesion. There is a growing body of research on the wellbeing and cohesion outcomes of music education programs delivered in作者: micturition 時間: 2025-3-22 01:59 作者: LINES 時間: 2025-3-22 05:55 作者: 橫條 時間: 2025-3-22 10:28 作者: Pde5-Inhibitors 時間: 2025-3-22 14:45
Nikita Fedin,Eduard Gorbunovg similarity mainly of color of playing fields does not sometimes allow the detection of a video transition. On the other hand, very short shots of several frames are detected in case of dissolve effects or they are simply false detections. Most often it is due to very dynamic movements of players o作者: Infiltrate 時間: 2025-3-22 20:40 作者: 富足女人 時間: 2025-3-22 22:16 作者: 滴注 時間: 2025-3-23 03:02
tial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance compa作者: 類似思想 時間: 2025-3-23 07:35
Vladimir Khandeev,Sergey Neshchadimtial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance compa作者: 仔細閱讀 時間: 2025-3-23 13:45 作者: 一再煩擾 時間: 2025-3-23 15:49
Artem V. Pyatkintial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance compa作者: 褻瀆 時間: 2025-3-23 21:03
Ilya Chernykh,Olga Krivonogova,Anna ShmyrinaTo achieve the objective, the study was divided into four main parts. The first elaborates on the issue of selecting tools in the software development cycle, indicating the need for departments creating IT systems to use appropriate tools for the given organization. The second part is devoted to the作者: 賭博 時間: 2025-3-23 23:31 作者: Flirtatious 時間: 2025-3-24 03:42
Mathematical Optimization Theory and Operations Research22nd International C作者: GUISE 時間: 2025-3-24 10:34 作者: 不舒服 時間: 2025-3-24 13:09 作者: 做事過頭 時間: 2025-3-24 16:33 作者: arbiter 時間: 2025-3-24 22:43
Aggregation Tree Construction Using Hierarchical Structuresifferent ., we find a conflict-free schedule applying the best-known algorithms. The outcome of our method is the best schedule found on .-ATs with different values of .. To assess the quality of the proposed approach, we carried out a numerical experiment on the randomly constructed unit-disk graph作者: 小畫像 時間: 2025-3-25 01:21
Enumeration and?Unimodular Equivalence of?Empty Delta-Modular Simplices fixed, we show that the all unimodular equivalence classes of simplices of both types can be enumerated by a polynomial-time algorithm. As the secondary result, we show the existence of a polynomial-time algorithm for the problem to check the unimodular equivalence relation for a given pair of .-mo作者: Anthology 時間: 2025-3-25 04:04
Distributionally Robust Optimization by Probability Criterion for?Estimating a?Bounded Signalarkov inequality; 2) applying the explicit multivariate Selberg bound to the problem with quantile criterion. Numerical simulations are performed to compare the two methods applied to the problem of target path recovery.作者: 惡心 時間: 2025-3-25 08:26 作者: GREG 時間: 2025-3-25 12:58 作者: 含水層 時間: 2025-3-25 18:11 作者: 直覺好 時間: 2025-3-25 21:21 作者: 出處 時間: 2025-3-26 03:27
Nested (2,3)-Instances of?the?Cutting Stock Problemnstruction gives the gap greater than . for any .. In this paper we give a construction of (2,?3)-instances having recursive (nested) structure and the gap greater than . for any .. We also give a construction of CSP instances with the gap greater than . for any ..作者: SOW 時間: 2025-3-26 07:21
0302-9743 inatorial optimization; stochastic optimization; scheduling; game theory; and optimal control and mathematical economics. The book also contains one invited talk in full paper length.?.978-3-031-35304-8978-3-031-35305-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 舊病復(fù)發(fā) 時間: 2025-3-26 10:12
Constant-Factor Approximation Algorithms for?Some Maximin Multi-clustering Problemse cluster elements to the center, which is defined differently in each of the problems. We show that these problems are NP-hard in the case of an arbitrary fixed number of clusters and propose polynomial constant-factor approximation algorithms for this case.作者: euphoria 時間: 2025-3-26 14:11
On the?Resource Allocation Problem to?Increase Reliability of?Transport Systemsabilistic criterion is reduced to the integer linear programming problem. We propose the procedure to obtain an approximate solution in the problem with the quantile criterion based on the Chernoff bound and solution of mixed integer nonlinear programming problems.作者: Banister 時間: 2025-3-26 16:57
Conference proceedings 2023lected from 89 submissions. They were organized in topical sections as follows:?Mathematical programming and applications; discrete and combinatorial optimization; stochastic optimization; scheduling; game theory; and optimal control and mathematical economics. The book also contains one invited talk in full paper length.?.作者: Blazon 時間: 2025-3-27 00:27
0302-9743 arch, MOTOR?2023, held in Ekaterinburg, Russia, during July 2–8, 2023.?The 28 full papers and 1 short paper included in this book were carefully reviewed and selected from 89 submissions. They were organized in topical sections as follows:?Mathematical programming and applications; discrete and comb作者: 有害 時間: 2025-3-27 01:42
On the?Uniqueness of?Identification the?Thermal Conductivity and?Heat Capacity of?Substancengle solution, the solution of other problems is not the only one. The conditions of uniqueness of the solution to the inverse problem are formulated and justified. A class of temperature fields from the reachable sets is specified, for which the solution to the identification problem under consideration will be non-unique.作者: Optimum 時間: 2025-3-27 05:27
Conference proceedings 2023R?2023, held in Ekaterinburg, Russia, during July 2–8, 2023.?The 28 full papers and 1 short paper included in this book were carefully reviewed and selected from 89 submissions. They were organized in topical sections as follows:?Mathematical programming and applications; discrete and combinatorial 作者: 裂縫 時間: 2025-3-27 09:43 作者: 馬賽克 時間: 2025-3-27 16:16
On Decentralized Nonsmooth Optimizationnctions lower bounds are known along with optimal algorithms. We study a specific class of problems: linear models with nonsmooth loss functions. Our algorithm combines regularization and dual reformulation to get an effective optimization method with complexity better than the lower bounds.作者: parasite 時間: 2025-3-27 18:38 作者: saphenous-vein 時間: 2025-3-27 22:51 作者: Phenothiazines 時間: 2025-3-28 04:04
On the?Uniqueness of?Identification the?Thermal Conductivity and?Heat Capacity of?Substancectivity of a substance that is based on the results of experimental observation of the temperature field dynamics in the object. The algorithm is based on the first boundary value problem for a one-dimensional non-stationary heat equation. The considered inverse coefficient problem is reduced to a v作者: Exaggerate 時間: 2025-3-28 06:34
Constant-Factor Approximation Algorithms for?Some Maximin Multi-clustering Problems is required to maximize the minimum cluster’s cardinality under constraint on each cluster’s scatter. The scatter is the sum of the distances from the cluster elements to the center, which is defined differently in each of the problems. We show that these problems are NP-hard in the case of an arbi作者: Eeg332 時間: 2025-3-28 11:15 作者: 不合 時間: 2025-3-28 17:48
Enumeration and?Unimodular Equivalence of?Empty Delta-Modular Simplicess are bounded by . in an absolute value. In our work we call a simplex ., if it can be defined by a system . with a .-modular matrix .. And we call a simplex ., if it contains no points with integer coordinates. In literature, a simplex is called ., if all its vertices have integer coordinates. And 作者: Confirm 時間: 2025-3-28 18:46 作者: entitle 時間: 2025-3-28 23:15
Nested (2,3)-Instances of?the?Cutting Stock Probleme container either two or three times. The gap of a CSP instance is the difference between its optimal function value and the optimal value of its continuous relaxation. For most instances of CSP the gap is less than 1, and the maximal gap currently known is .. For the (2,?3)- case the best known co作者: DEMUR 時間: 2025-3-29 04:03
On the?Resource Allocation Problem to?Increase Reliability of?Transport Systemsvents to describe reliability of transport system elements. Probabilistic and quantile criteria are considered for optimization. The problem with probabilistic criterion is reduced to the integer linear programming problem. We propose the procedure to obtain an approximate solution in the problem wi作者: 壕溝 時間: 2025-3-29 07:45
Distributionally Robust Optimization by Probability Criterion for?Estimating a?Bounded Signalnts with known second-order moment characteristics of the observation noise. The objective functional is the probability that the L2-norm of the estimation error will exceed a given threshold. To take into account the prior uncertainty, the upper bound of the probability functional is considered ove作者: CODA 時間: 2025-3-29 14:05 作者: 后退 時間: 2025-3-29 15:54 作者: 巡回 時間: 2025-3-29 22:32
in schools. Firstly, because research suggests they have a real impact on teenagers’ mental health. Secondly, because science points out that wellbeing and academic achievement go hand in hand. Finally, because schools are amongst the best places to reach teens. But how can wellbeing skills can be 作者: 整頓 時間: 2025-3-30 00:28 作者: debouch 時間: 2025-3-30 07:48
Natalia Obrosova,Alexander Shananincape. The importance of participatory music-making, including ensemble performance, is explored, acknowledging research pointing to the value of this area of music education. The rapid development of the neuro-musical field of research over the past twenty years has enabled understanding of the sign作者: fulmination 時間: 2025-3-30 08:35 作者: 蠟燭 時間: 2025-3-30 14:32 作者: 貞潔 時間: 2025-3-30 16:53 作者: VOC 時間: 2025-3-30 23:22 作者: Amendment 時間: 2025-3-31 04:17
Vladimir Zubovosium was organized togive a wide-ranging overview of new work in thefield on theoccasion of the fiftieth birthday of the editor of thevolume.Topics covered include: information on neural nets, ideas ona new paradigm for informatics, hypermedia systems andapplications, axioms for concurrent processe作者: 滋養(yǎng) 時間: 2025-3-31 08:44
nt new requirements on spatial database systems, in particular on efficient query processing of complex spatial objects. In this paper, we propose a two-level, multi-representation query processing technique which consists of a filter and a refinement level. The efficiency of spatial query processin作者: amorphous 時間: 2025-3-31 12:12
Vladimir Khandeev,Sergey Neshchadimnt new requirements on spatial database systems, in particular on efficient query processing of complex spatial objects. In this paper, we propose a two-level, multi-representation query processing technique which consists of a filter and a refinement level. The efficiency of spatial query processin作者: 解脫 時間: 2025-3-31 16:29
Adil Erzin,Roman Plotnikov,Ilya Ladyginosium was organized togive a wide-ranging overview of new work in thefield on theoccasion of the fiftieth birthday of the editor of thevolume.Topics covered include: information on neural nets, ideas ona new paradigm for informatics, hypermedia systems andapplications, axioms for concurrent processe作者: 難管 時間: 2025-3-31 20:25
