Results 61 to 70 of about 6,708,930 (288)
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019 This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and
Sven Löffler +2 more
openaire +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Dynamic ICSP Graph Optimization Approach for Car-Like Robot Localization in Outdoor Environments
Computers, 2019 Localization has been regarded as one of the most fundamental problems to enable a mobile robot with autonomous capabilities. Probabilistic techniques such as Kalman or Particle filtering have long been used to solve robotic localization and mapping ...
Zhan Wang, Alain Lambert, Xun Zhang
doaj +1 more source
Journal of Big Data, 2021 To address the challenges of big data analytics, several works have focused on big data optimization using metaheuristics. The constraint satisfaction problem (CSP) is a fundamental concept of metaheuristics that has shown great efficiency in several ...
Imad Sassi +2 more
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
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2010 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
Adaptive Foam 3D Printing of Ultralight and Multifunctional Materials
Advanced Engineering Materials, EarlyView.Adaptive foam 3D printing, enabled by expandable microspheres, imparts cellular structures to thermoplastic and thermosetting polymers, manufactured through a variety of processes including fused filament fabrication, direct ink writing, digital light processing, and inkjet printing.
Nariman Rajabifar, Amir Ameli
wiley +1 more source
Supermodularity on chains and complexity of maximum constraint satisfaction [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In the maximum constraint satisfaction problem ($\mathrm{Max \; CSP}$), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so ...
Vladimir Deineko +3 more
doaj +1 more source