Abstract: Graph-structured combinatorial problems in complex networks are prevalent in many domains, and are computationally demanding due to their complexity and non-linear nature. Traditional ...
Abstract: The paper studies discrete-time statistical filtering problems with the goal to minimize expected total costs. Such problems are usually defined by pairs of stochastic equations and by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results