„Complex problems“
Suchergebnisse
2.217 Treffer
-
Linearization Problems for Lie Algebroids and Lie Groupoids
-
On Stochastic Conditional Independence: the Problems of Characterization and Description
-
R. S. Berry (University of Chicago), V. Kazakov (University of Sydney), S. Sieniutycz (Warsaw TU), Z. Szwast, (Warsaw TU), and A. M. Tsirlin (Moscow System Analysis Centre), Thermodynamic Optimization of Finite-Time Processes,; S. Sieniutycz (Warsaw TU), Variational Approach in Non-Equilibrium Thermodynamics, Chapter 6 (pp. 119–156) in the book: Contemporary Problems of Thermodynamics
-
Improvement of the Convergence of Fourier–Hankel Series in Solving Two‐Dimensional Heat‐Conduction Problems
-
Modern Problems of Thermal Protection
-
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems
-
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
-
Linear and Nonlinear Problems on the Elastic Deformation of Complex Shells and Methods of Their Numerical Solution
-
Problems with fitting to the power-law distribution
-
Hybrid Feedforward Neural Networks for Solving Classification Problems
-
Conjugate Problems of Heat and Mass Exchange and the Physicomathematical Theory of Forest Fires
-
Modern Problems of Intensification of Heat Exchange in Channels
-
Self‐Organization and Dynamic Chaos in Chemical‐Technology and Heat‐Exchange Devices: Problems and Tasks
-
Analytical Methods of Solution of Boundary‐Value Problems of Nonstationary Heat Conduction in Regions with Moving Boundaries
-
Solution of Mixed Contact Problems in the Theory of Nonstationary Heat Conduction by the Method of Summation‐Integral Equations
-
Accommodation Two‐Moment Boundary Conditions in Problems of Thermal and Isothermal Slip
-
System of Differential Equations for the Lattice Problems of the Percolation Theory
-
Some results of homogeneous expansions for a class of biholomorphic mappings defined on a Reinhardt domain in ℂ n
-
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
-
Strong bounds on the approximability of two Pspace-hard problems in propositional planning