Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.

Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.

Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Robust optimization is a fairly new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. The authors are the principal developers of robust optimization.

Robust optimization. --- Linear programming. --- 519.8 --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.8 Operational research --- Operational research --- Robust optimization --- Linear programming --- Optimisation robuste --- Programmation linéaire --- Optimization, Robust --- RO (Robust optimization) --- Mathematical optimization --- Production scheduling --- Programming (Mathematics) --- 0O. --- Accuracy and precision. --- Additive model. --- Almost surely. --- Approximation algorithm. --- Approximation. --- Best, worst and average case. --- Bifurcation theory. --- Big O notation. --- Candidate solution. --- Central limit theorem. --- Chaos theory. --- Coefficient. --- Computational complexity theory. --- Constrained optimization. --- Convex hull. --- Convex optimization. --- Convex set. --- Cumulative distribution function. --- Curse of dimensionality. --- Decision problem. --- Decision rule. --- Degeneracy (mathematics). --- Diagram (category theory). --- Duality (optimization). --- Dynamic programming. --- Exponential function. --- Feasible region. --- Floor and ceiling functions. --- For All Practical Purposes. --- Free product. --- Ideal solution. --- Identity matrix. --- Inequality (mathematics). --- Infimum and supremum. --- Integer programming. --- Law of large numbers. --- Likelihood-ratio test. --- Linear dynamical system. --- Linear inequality. --- Linear map. --- Linear matrix inequality. --- Linear regression. --- Loss function. --- Margin classifier. --- Markov chain. --- Markov decision process. --- Mathematical optimization. --- Max-plus algebra. --- Maxima and minima. --- Multivariate normal distribution. --- NP-hardness. --- Norm (mathematics). --- Normal distribution. --- Optimal control. --- Optimization problem. --- Orientability. --- P versus NP problem. --- Pairwise. --- Parameter. --- Parametric family. --- Probability distribution. --- Probability. --- Proportionality (mathematics). --- Quantity. --- Random variable. --- Relative interior. --- Robust control. --- Robust decision-making. --- Semi-infinite. --- Sensitivity analysis. --- Simple set. --- Singular value. --- Skew-symmetric matrix. --- Slack variable. --- Special case. --- Spherical model. --- Spline (mathematics). --- State variable. --- Stochastic calculus. --- Stochastic control. --- Stochastic optimization. --- Stochastic programming. --- Stochastic. --- Strong duality. --- Support vector machine. --- Theorem. --- Time complexity. --- Uncertainty. --- Uniform distribution (discrete). --- Unimodality. --- Upper and lower bounds. --- Variable (mathematics). --- Virtual displacement. --- Weak duality. --- Wiener filter. --- With high probability. --- Without loss of generality.