نتایج جستجو برای: constraint method

تعداد نتایج: 1689629  

Journal: :ادب فارسی 0
محسن باغبانی دانش¬آموختۀ کارشناسی ارشد زبان و ادبیات فارسی دانشگاه علامه طباطبایی

“synopsis and explainer” methodological discussion has been reflexed, in literary domain, as stipulation and constraint; but synopsis explanation seems being different to what happens in methodology because sometimes the meanings of lexical items and combinations are given on individual, probabilistic, and untrustworthy interpretations. present paper, applying few lines of nasser khosrow’s seco...

2015
Sebastian Krings Jens Bendisposto Michael Leuschel

The ProB disprover uses constraint solving to find counterexamples for B proof obligations. As the ProB kernel is now capable of determining whether a search was exhaustive, one can also use the disprover as a prover. In this paper, we explain how ProB has been embedded as a prover into Rodin and Atelier B. Furthermore, we compare ProB with the standard automatic provers and SMT solvers used in...

2004
Boris Doval Baris Bozkurt Christophe d'Alessandro Thierry Dutoit

This study proposes a new spectral decomposition method for source-tract separation. It is based on a new spectral representation called the Zeros of Z-Transform (ZZT), which is an all-zero representation of the z-transform of the signal. We show that separate patterns exist in ZZT representations of speech signals for the glottal flow and the vocal tract contributions. The ZZT-decomposition is...

Journal: :Applied Mathematics and Computation 2006
Jafar Biazar

In this article the problem of the spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic is considered. Mathematical modeling of the problem leads to a system of non-linear ordinary differential equations. Adomian decomposition method is employed to solve this system of nonlinear ordinary differential equations, the problem of conve...

1996
R. Duncan Luce

Assuming that binary rankand sign-dependent utility holds for gambles and that riskless choice utility can be constructed using the binary operation of joint receipt of consequences, there are four distinct measures of utility over gains: the two, one from gambles and the other from joint receipt, that arise by working with the trade-offs of just gains and the two that arise by working with the...

M. Eslami

This paper studies the generalized version of theZakharov-Kuznetsov Benjamin-Bona-Mahoney equation. The functionalvariable method as well as the simplest equation method areapplied to obtain solitons and singular periodic solutions to theequation. There are several constraint conditions that arenaturally revealed in order for these specialized type ofsolutions to exist. The results of this pape...

We present a method to gauge second class systems consisted of two constraints in the chain structure. In this method we added a momentum counterpart of Wess Zumino coordinate to primary constraint and used the first class condition to find a new and gauged Hamiltonian. Primary constraints were assumed as identities in configuration and phase space and we tried to find general Hamiltonians

2003
Christian Bessiere Emmanuel Hebrard Toby Walsh

We introduce some new mappings of constraint satisfaction problems into propositional satisfiability. These encodings generalize most of the existing encodings. Unit propagation on those encodings is the same as establishing relational k-arc consistency on the original problem. They can also be used to establish (i,j)-consistency on binary constraints. Experiments show that these encodings are ...

Journal: Money and Economy 2020

Daily price limits are adopted by many securities exchanges in countries such as the USA, Canada, Japan and various other countries in Europe and Asia, in order to increase the stability of the financial market. These limits confine the price of the financial asset during all trading stages of any trading day to a range, usually determined based on the previous day’s closing price. In this pape...

2005
Fahiem Bacchus Toby Walsh

Many constraint toolkits provide logical connectives like disjunction, negation and implication. These permit complex constraint expressions to be built from primitive constraints. However, the propagation of such complex constraint expressions is typically limited. We therefore present a simple and light weight method for propagating complex constraint expressions. We provide a precise charact...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید