نتایج جستجو برای: green satisfaction

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

2007
Sander Canisius Erik F. Tjong Kim Sang

We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighted soft-constraints on parts of the complex output. From these constraints, a standard weighted constraint satisfaction problem can be formed, the solution to which is a valid dependency tree.

Journal: :IEEE Pervasive Computing 2009
Roy Want

I n a world that has become acutely aware of the environmental impact of energy consumption resulting in global warming, and the increasing financial burden of oil after the price spiked this past July to US$145 per barrel, energy conservation has become a hot topic. This is an opportunity for pervasive computing to play an important role in conserving our planetary resources and moving us towa...

Journal: :International Journal For Multidisciplinary Research 2022

The ever increasing population and changing lifestyles are making the environmental problems more critical. Higher education institutions can be best solution to solve this solution. play a crucial role in sustainable development of any nation. present study is attempted know awareness faculties their satisfaction about Green HRM Practices adopted colleges. chosen descriptive nature. same size ...

1992
Walter Hower

The constraint satisfaction problem (CSP) deals with the assignment of values to variables according to existing constraints. Given n variables with their nite domains, the admissible combinations of values form a set of n-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0 Introduction The constraint satisfact...

Journal: :SIAM J. Discrete Math. 2015
Johan Thapper Stanislav Zivny

The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP’13] have characterised a Galois connection between valued constraint languages and so-called weighted clones. In this paper, we study the structure of weighted clones. We extend the results of Creed and ...

Journal: :Asian Management and Business Review 2021

Public awareness in Indonesia responding to global warming has increased significantly. Increased public plays an important role providing challenges and opportunities for companies that provide goods or services create products are accordance with their wishes. The challenge is guarantee the provided safe consumers friendly do not damage environment. concept of green marketing mix refers satis...

2012
Mohamed Wahbi

Follow up what we will offer in this article about algorithms and ordering heuristics for distributed constraint satisfaction problems. You know really that this book is coming as the best seller book today. So, when you are really a good reader or you're fans of the author, it does will be funny if you don't have this book. It means that you have to get this book. For you who are starting to l...

1998
Steffen Staab

I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. Moreover, I investigate how several factors underlying my gene...

2009
Nele Verbiest Chris Cornelis Yvan Saeys

Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably hold, but are not mandatory. In this paper, we model this problem as a valued constraint satisfaction problem (VCSP): costs are assigned to possible solutions based on the constraints they violate. We design an algorith...

2003
Markus Stumptner Franz Wotawa

Decomposition methods are used to convert general constraint satisfaction problems into an equivalent tree-structured problem that can be solved more effectively. Recently, diagnosis algorithms for treestructured systems have been introduced, but the prerequisites of coupling these algorithms to the outcome of decomposition methods have not been analyzed in detail, thus limiting their diagnosti...

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

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