Results 41 to 50 of about 15,438 (311)
Linear Datalog and Bounded Path Duality of Relational Structures [PDF]
Logical Methods in Computer Science, 2005 In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs.
Victor Dalmau
doaj +1 more source
International Journal of Naval Architecture and Ocean Engineering, 2022 The object of the long-term planning in shipyards is to assign the ordered vessels to the berths with the consideration of the workload balancing. However, there are limitations in establishing an optimized long-term plan because the workload balancing ...
Dong Hoon Kwak +4 more
doaj +1 more source
Promise constraint satisfaction problems
, 2022 The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the promise that a solution exists under the strict constraints,
openaire +3 more sources
The energy scheduling problem: Industrial case-study and constraint propagation techniques [PDF]
, 2013 This paper deals with production scheduling involving energy constraints, typically electrical energy. We start by an industrial case-study for which we propose a two-step integer/constraint programming method.
Pierre Lopez +5 more
core +1 more source
Constraint satisfaction problems and global cardinality constraints [PDF]
Communications of the ACM, 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 certain value.
Andrei A. Bulatov, Dániel Marx
openaire +1 more source
Harmony search algorithm with adaptive parameter setting for solving large bin packing problems [PDF]
Decision Science Letters, 2020 Bin packing problem is a constrained optimization problem with a huge search space due to large combinations. Bin packing problem has a wide range of applications in multiple fields.
Amol C. Adamuthe , Tushar Nitave
doaj +1 more source
Caterpillar Duality for Constraint Satisfaction Problems [PDF]
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008 The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems that are definable in the smallest natural recursive fragment of Datalog - monadic linear Datalog with at most one EDB per rule.
Catarina Carvalho +2 more
openaire +2 more sources
On Redundancy in Constraint Satisfaction Problems.
, 2022 A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(n^r), but there are notable examples for which this upper bound is far from the best possible.
openaire +3 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems
Computers, 2015 Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a ...
Abhishek Bhatia +2 more
doaj +1 more source