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

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

Journal: :iranian journal of oil & gas science and technology 2015
mohammad reza mahdiani ehsan khamehchi

one of the problems that sometimes occur in gas allocation optimization is instability phenomenon. this phenomenon reduces the oil production and damages downhole and surface facilities. different works have studied the stability and suggested some solutions to override it, but most of them (such as making the well intelligent) are very expensive and thus they are not applicable to many cases. ...

2004
Yaling Zheng Berthe Y. Choueiry

We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree.

Journal: :J. Comput. Syst. Sci. 2008
David A. Cohen Peter Jeavons Marc Gyssens

In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of de...

2008
Artan Dermaku Tobias Ganzow Georg Gottlob Benjamin J. McMahan Nysret Musliu Marko Samer

The literature provides several structural decomposition methods for identifying tractable subclasses of the constraint satisfaction problem. Generalized hypertree decomposition is the most general of such decomposition methods. Although the relationship to other structural decomposition methods has been thoroughly investigated, only little research has been done on efficient algorithms for com...

2005
David A. Cohen Peter Jeavons Marc Gyssens

In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterized in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of...

Journal: :The Journal of the Korea Contents Association 2007

Journal: :IOP Conference Series: Earth and Environmental Science 2019

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

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