Society for Industrial and Applied Mathematics, ... DG Harris,A Srinivasan - Society for Industrial and Applied Mathematics 被引量: 14发表: 2015年 Prediction with Expert Advice: A PDE Perspective (in: Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms, SODA '16,...
[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the ... Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a ...
Are you and your team up to it? Problem Choices Contest teams of up to three students address one of the following six problem choices over the period of the contest weekend. MCM Problem A (continuous) MCM Problem B (discrete) MCM Problem C (data insights) ICM Problem D (operations ...
x(t + 1) − x(t) for a discrete-time system, and a compound of these two operations for a hybrid system. Additionally,\({{{ u}}}\in {{\mathbb{R}}}^{d}\),\({{{ x}}}\in {{\mathbb{R}}}^{n}\), and\(...
Operations research (OR) has been at the core of decision making since World War II, and today, business interactions on different platforms have changed b
,A Hamzeh - 《Discrete Applied Mathematics》 被引量: 173发表: 2010年 Minimizing Degree-based Topological Indices for Trees with Given Number of Pendent Vertices We derive sharp lower bounds for the first and the second Zagreb indices (M-1 and M-2 respectively) for trees and chemical trees ...
Pakshin, P.V., Diskretnye sistemy so sluchainymi parametrami i strukturoi (Discrete Systems with Random Parameters and Structure), Moscow: Nauka, 1994. Google Scholar Leonov, G.A., Burkin, I.M., and Shepelyavyi, A.I., Frequency Methods in Oscillation Theory, Dordrecht: Kluwer, 1995...
From a mathematical viewpoint, a temporal network G with N nodes can be formalised as a set of L discrete-time stochastic processes G={Eα}α=1,2,…,L, where L≤ N(N − 1)/2 is the number of different pairs of nodes that can be connected by links over time. Each Eα=...
These new algorithms propose a new approach to modeling the decision space, while maintaining control over any aspects of the agent's behavior. The algorithms can be applied to all combinations of discrete or continuous decision and state spaces. ...
The superstructure-based optimization problem involves both discrete and continuous variables and thus can be written as a mixed-integer nonlinear programming (MINLP) problem aimed at minimizing a nonlinear objective function subject to nonlinear constraints [27,28,29]. Note that generalized disjunctive ...