With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

Casimir forces of massive ferrnionic Dirac fields are calculated for parallel plates geometry in spatial space with dimension d and imposing bag model boundary conditions. It is shown that in the range of ma>>l where m is mass of fields quanta and a is the separation distance of the plates, it is equal to massive bosonic fields Casimir force for each degree of freedom. We argue this equalit...

In this paper, we propose a technique for detecting keywords quickly from a very large speech database without using a large memory space. To accelerate searches and save memory, we used a suffix array as the data structure and applied phoneme-based DP-matching. To avoid an exponential increase in the process time with the length of the keyword, a long keyword is divided into short sub-keywords...

State space search problems abound in the artificial intelligence, planning and optimization literature. Solving such problems is generally NP-hard, so that a brute-force approach to state space search must be employed. Given the exponential amount of work that state space search problems entail, it is desirable to solve them on large parallel machines with significant computational power. In t...

We describe an algorithm that generates prime implicates of equational clause sets without variables and function symbols. The procedure is based on constrained superposition rules, where constraints are used to store literals that are asserted as additional axioms (or hypotheses) during the proof search. This approach is sound and deductive-complete, and it is more e cient than previous algori...

We consider the problem of investigating the structure of the space of all possible cliques in random graphs generated according to the Gn; 12 ;K model. This model consists of all graphs on n nodes and edge probability 1=2, in which a random set ofK nodes is forced to be a clique. In this work we make a ̄rst attempt to explain the hardness of the problem by revealing the combinatorial character...

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...