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

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

2015
LIBOR BARTO

This paper gives a brief survey of current research on the complexity of the constraint satisfaction problem over fixed constraint languages. §

2010
Matthias Westphal Stefan Wölfl Jason Jingshi Li

This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonally to usual methods for solving qualitative constraint satisfaction problems. In particular, we propose a more general definition of nogoods that allows for exploiting information about nogoods and tractable subclasses during ba...

1999
Víctor Dalmau Justin Pearson

Local Consistency has proven to be an important notion in the study of constraint satisfaction problems. We give an algebraic condition that characterizes all the constraint types for which generalized arc-consistency is suucient to ensure the existence of a solution. We give some examples to illustrate the application of this result.

2015
Carsten Lutz Frank Wolter

Recently, Fontaine has pointed out a connection between consistent query answering (CQA) and constraint satisfaction problems (CSP) [22]. We investigate this connection more closely, identifying classes of CQA problems based on denial constraints and GAV constraints that correspond exactly to CSPs in the sense that a complexity classification of the CQA problems in each class is equivalent (up ...

2011
Nguyen-Thinh Le Niels Pinkwart

Constraint-based modelling techniques have been demonstrated a useful means to develop intelligent tutoring systems in several domains. However, when applying CBM to tasks which require students to explore a large solution space, this approach encounters its limitation: it is not well suited to hypothesize the solution variant intended by the student, and thus corrective feedback might be not i...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2004
Zdenek Dvorak Daniel Král Ondrej Pangrác

An instance of a constraint satisfaction problem (CSP) is variable k-consistent if any subinstance with at most k variables has a solution. For a fixed constraint language L, ρk(L) is the largest ratio such that any variable k-consistent instance has a solution that satisfies at least a fraction of ρk(L) of the constraints. We provide an expression for the limit ρ(L) := limk→∞ ρk(L), and show t...

Journal: :Artif. Intell. 2002
Rina Dechter Daniel Frost

Journal: :iranian journal of psychiatry and behavioral sciences 0
tayebe ziaee yadollah jannati elham mobasheri taraneh taghavi habib abdollahi mahnaz modanloo faculty of nursingand midwifery, golestan university of medical sciences, hirkan bulvar, gorgan, iran. p.o.box: 49165-568.

objective: there are various elements affecting the healthy family such as marital satisfaction. various factors such as sexual satisfaction have an important impact on satisfaction of marital relationship. the present study aimed to determine the association of marital satisfaction with sexual satisfaction among sexually active employee women. methods: this analytical descriptive study was car...

Journal: :مدیریت بازرگانی 0
محسن نطری دانشیار گروه مدیریت بازرگانی، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران محمدعلی شاه حسینی استادیار گروه مدیریت mba دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران سیدوحید طباطبائی کلجاهی دانشجوی دکتری مدیریت بازاریابی، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران

price fairness and price satisfaction is one the most important fields in pricing and also in customer satisfaction. in this research, first the dimensions of price fairness, price satisfaction, customer satisfaction, and customer loyalty are extracted from marketing literature, then five hypotheses are developed. in proposed model, price fairness has direct impact on price satisfaction, custom...

2007
Margarita Razgon Barry O'Sullivan Gregory M. Provan

Over the past decade impressive advances have been made in solving Constraint Satisfaction Problems by using of randomization and restarts. In this paper we propose a new class of variable and value ordering heuristics based on learning from nogoods without storing them. We show empirically that these heuristics dramatically improve the performance of restarts-based constraint solving.

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

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