Results 21 to 30 of about 15,838 (263)
Open Constraint Satisfaction [PDF]
, 2002 Traditionally, constraint satisfaction has been applied in closed-world scenarios, where all choices and constraints are known from the beginning and fixed. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where choices and constraints are to be ...
Faltings, Boi +2 more
openaire +1 more source
Implicit Motives and Men’s Perceived Constraint in Fatherhood
Frontiers in Psychology, 2016 Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and
Jessica Ruppen +6 more
doaj +1 more source
Global constraints in distributed constraint satisfaction
International Joint Conference on Autonomous Agents and Multiagent Systems, 2012 Global constraints have been crucial for the success of centralized constraint programming. Here, we propose the inclusion of global constraints in distributed constraint satisfaction. We show how this inclusion can be done, considering different decompositions for global contraints.
Bessiere, Christian +3 more
openaire +3 more sources
Penerapan Theory of Constraint pada Kepuasan Kerja Karyawan Rumah Sakit Mata Undaan Surabaya
Jurnal Administrasi Kesehatan Indonesia, 2016 The level of job satisfaction in Undaan Eye Hospital had fluctuating trend since 2012 to 2015. The level of job satisfaction in 2015 was 77,80% that had not reached the target of 80%.
Selviana Putri Larasati, Setya Haksama
doaj +1 more source
Locked Constraint Satisfaction Problems [PDF]
Physical Review Letters, 2008 4 pages, 2 ...
Zdeborová, Lenka, Mézard, Marc
openaire +4 more sources
The complexity of global cardinality constraints [PDF]
Logical Methods in Computer Science, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Andrei A. Bulatov, Daniel Marx
doaj +1 more source
Discrete optimization using Quantum Annealing on sparse Ising models
Frontiers in Physics, 2014 This paper discusses techniques for solving discrete optimization problems using quantumannealing. Practical issues likely to affect the computation include precision limitations, finitetemperature, bounded energy range, sparse connectivity, and small ...
Zhengbing eBian +5 more
doaj +1 more source
Applying quantum algorithms to constraint satisfaction problems [PDF]
Quantum, 2019 Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical ...
Earl Campbell +2 more
doaj +1 more source
Tropically Convex Constraint Satisfaction [PDF]
Theory of Computing Systems, 2017 A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity.
Manuel Bodirsky, Marcello Mamino
openaire +2 more sources
Scale-Free Random SAT Instances
Algorithms, 2022 We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time ...
Carlos Ansótegui +2 more
doaj +1 more source