نتایج جستجو برای: constraint model
تعداد نتایج: 2157921 فیلتر نتایج به سال:
In this paper, an inventory model for deterioration items in a two-echelon supply chain including one retailer and one manufacturer is proposed by considering the stock and price dependent demand and capacity constraint for holding inventories. First, the model is presented as a leader-follower game in which the manufacturer announces wholesale prices. Second, the retailer decides for the order...
The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP∨), correspond naturally to the model checking problem for three increasingly stronger fragments of positive first-order logic. Their complexity is often studied when parameterised by a fixed model, the so-called template. It is a natural question to ask when two templates ar...
In this paper we report our work on a new constraint domain, where variables can take structured values. Earth-science data processing (ESDP) is a planning domain that requires the ability to represent and reason about complex constraints over structured data, such as satellite images. This paper reports on a constraint-based planner for ESDP and similar domains. We discuss our approach for tra...
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations or nogoods. Two main families of consistencies have been introduced so far : those that permit to reason from variables such as (i, j)-consistency and those that permit to reason from constraints such as relational (i, j)...
In this paper we consider a new class of logic programs, called weight constraint programs with functions, which are lparse programs incorporating functions over non-Herbrand domains. We define answer sets for these programs and develop a computational mechanism based on loop completion. We present our results in two stages. First, we formulate loop formulas for lparse programs (without functio...
In current modeling systems, all dimensions in a model have to be fully specified by the user. It is desirable that systems become more flexible in this respect, i.e. that non-critical dimensions in a model can be declared variant, and that the model can be automatically adjusted to enforce its validity when it is invalid. A method to realize this in feature modeling systems is described. The u...
Feature Models are used in different stages of software development and are recognized to be an important asset in model transformation techniques and software product line development. The automated analysis of feature models is being recognized as one of the key challenges for automated software development in the context of Software Product Lines. In our previous work we explained how a feat...
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open prob...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید