since the emergence of power market, the target of power generating utilities has mainly switched from cost minimization to revenue maximization. they dispatch their power energy generation units in the uncertain environment of power market. as a result, multi-stage stochastic programming has been applied widely by many power generating agents as a suitable tool for dealing with self-scheduling...

Portfolio and risk management problems of power utilities may be modeled by multistage stochastic programs. These models use a set of scenarios and corresponding probabilities to model the multivariate random data process (electrical load, stream flows to hydro units, and fuel and electricity prices). For most practical problems the optimization problem that contains all possible scenarios is t...

In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in the form of scenario tree. This paper presents the approach to generate the multistage multidimensional scenario tree out of a set of scenario fans. For this purpose, the multistage K-means clustering algorithm is developed. The ...

Scenario tree models of stochastic programs arise naturally under standard nonanticipativity assumptions. We demonstrate how tree-sparse programs cover the general case, with arbitrary information constraints. Detailed examples and intuitive interpretations illuminate the basic thoughts behind the abstract but elementary construction.

The first part of the paper briefly overviews the problem of gene and species trees reconciliation with the focus on defining and algorithmic construction of the evolutionary scenario. Basic ideas are discussed for the aspects of mapping definitions, costs of the mapping and evolutionary scenario, imposing time scales on a scenario, incorporating horizontal gene transfers, binarization and reco...

The solution of a multistage stochastic programming problem needs a suitable representation of uncertainty which may be obtained through a satisfactory scenario tree construction. Unfortunately there is a trade-off between the level of accuracy in the description of the stochastic component and the computational tractability of the resulting scenario-based problem. In this contribution we addre...

This thesis extends tree similarity based match-making from the buyer/seller situation to a scenario of bilateral bartering and multi-agent ring bartering. It is built on top of the AgentMatcher tree similarity algorithm for node-labelled, arc-labelled, arc-weighted trees. A representation of these trees in a multi-dimensional space is developed to allow efficient indexing and pruning in large ...

Web allows learners to investigate any question with a great variety of Web resources, in which they could construct a wider, and deeper knowledge. In such investigative learning process, it is important for them to deepen and widen the question, which involves decomposing the question into the sub-questions to be further investigated. This corresponds to creating a learning scenario that impli...