In this work, we first deal with the modeling of game situations that reach one possibly many Nash equilibria. Before an instance such a starts, external observer does not know, priori, what is exact profile actions -- constituting equilibrium will occur; thus, he assigns subjective probabilities to players' actions. Such scenario formalized as observable game, which newly introduced structure ...

Utilizing capacitor banks is very conventional in distribution network in order for local compensation of reactive power. This will be more important considering uncertainties including wind generation and loads uncertainty. Harmonics and non-linear loads are other challenges in power system which complicates the capacitor placement problem. Thus, uncertainty and network harmonics have been con...

To ensure efficient performance of irrigation canals, the losses from the canals need to be minimized. In this paper a modified formulation is presented to solve the optimization model for the design of different canal geometries for minimum seepage loss, in meta-heuristic environment. The complex non-linear and non-convex optimization model for canal design is solved using a probabilistic sear...

This paper presents a connectionist model of verb argument structure assignment that relies on probabilistic information regarding particular verbs, as well as semantic information shared among several verbs. The model illustrates how co-occurrence relations among different levels of linguistic representation may interact in acquisition by contributing to the discovery of language specific well...

Relational database systems are a successful platform to manage large amounts of data, but do not cope well with uncertainty. However, the amount of uncertain data is growing at an unprecedented rate from both traditional sources (e.g. integrating enterprise data) and from next generation sources (e.g. information extraction). This trend has prompted the database community to investigate a prom...

We introduce two new formulations for probabilistic constraints based on extended disjunctive formulations. Their strength results from considering multiple rows of the probabilistic constraints together. The properties of the first can be used to construct hierarchies of relaxations for probabilistic constraints, while the second provides computational advantages over other formulations.