Results 121 to 130 of about 15,438 (311)
Jurnal Komputer Terapan, 2017 Dalam rangka mengurangi kegemukan pada anak dan remaja, penting untuk melakukan perencanaan makan dan tumbuh kembang optimal. Dengan kondisi saat ini, para orang tua akan sangat membutuhkan sebuah pengetahuan tentang asupan makanan dan nutrisi yang ...
Syefrida Yulina, Dewi Hajar
doaj
Algorithms for Quantified Constraint Satisfaction Problems [PDF]
, 2004 Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reasoning tasks rises from NP-complete to PSPACE-complete.
Stergiou, K, Mamoulis, N
openaire +2 more sources
Modelling the Dynamics of Team Sensemaking: A Constraint Satisfaction Approach
, 2012 An approach to the modelling of team sensemaking is presented that relies on the use of multiple agents integrated into larger communication network structures.
Smart, Paul R., Shadbolt, Nigel R.
core
Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles
Advanced Optical Materials, EarlyView.Machine‐learning‐based inverse design is used optimize “metavehicles” — flat microparticles based on metagratings that generate a strong lateral optical force from normally incident light. The optimized design exhibits a force efficiency of ∼88% and a measured propulsion speed in water much higher than previously reported, demonstrating that inverse ...
Vasilii Mylnikov +2 more
wiley +1 more source
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX QuantumOne of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
Locally Consistent Constraint Satisfaction Problems
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zdenek Dvorák 0001 +2 more
openaire +2 more sources
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets
, 2013 International audienceA famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time.
Thapper, Johan +2 more
core +1 more source
Advanced Robotics Research, EarlyView.A soft robotic simulator is developed to replicate the digital removal of feces (DRF), a sensitive yet essential nursing procedure. Integrating soft actuators, sensors, and a realistic rectal model, the simulator balances functional fidelity with perceptual realism. Engineering evaluations and nurse feedback confirm its potential to enhance training in
Shoko Miyagawa +10 more
wiley +1 more source
Mathematics, 2019 Geometric programming problems are well-known in mathematical modeling. They are broadly used in diverse practical fields that are contemplated through an appropriate methodology.
Armita Khorsandi +2 more
doaj +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source