: nowadays, organizations are faced with a multitude of project and investment opportunities. despite the importance of various criteria, complexity of multi-objective models and weakness of optimization algorithms often compelled manager to limit the selection criteria or only suffice to financial objects. in this paper, it is endeavored to extend selection criteria by using an efficient optim...

Dynamic programing is one of the major problemsolving methodologies in a number of disciplines such as operations research and computer science. It is also a very important and powerful tool of thought. But not all is well on the dynamic programming front. There is definitely lack of commercial software support and the situation in the classroom is not as good as it should be. In this paper we ...

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

In this paper, we present a new method for line segments matching for indoor reconstruction. Instead of matching individual segments via a descriptor like most methods do, we match segment chains that have a distinctive topology using a dynamic programing formulation. Our method relies solely on the geometric layout of the segment chain and not on photometric or color profiles. Our tests showed...

This paper describes an efficient sampler for synchronous grammar induction under a nonparametric Bayesian prior. Inspired by ideas from slice sampling, our sampler is able to draw samples from the posterior distributions of models for which the standard dynamic programing based sampler proves intractable on non-trivial corpora. We compare our sampler to a previously proposed Gibbs sampler and ...

[ABSTRACT] The paper presents a data–driven execution model, CHEM, for a temporal logic programing language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument parallelism through unification. Context–parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataflow com...

In the current state-of-art beat tracker, it is common that a specific algorithm do the best on particular kind of audio. For example, the algorithm based on two-fold dynamic programing have sequential 1 st place on time-varying-tempo MAZ dataset of MIREX audio beat tracking. This study proposed a tempogram-sensing-vector (TSV) method to be adaptive to time-varying-tempo and stable-tempo excerp...