Results 121 to 130 of about 15,021 (304)
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
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
Constraint Satisfaction Techniques for Combinatorial Problems
, 2018 The last two decades have seen extraordinary advances in industrial applications of constraint satisfaction techniques, while combinatorial problems have been pushed to the sidelines.
Narváez, David
core +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
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
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
Abstract A Study of Search Methods: The Effect of
, 2008 with the search mode, and how the ratio of breadth of effort to depth of effort can be controlled. Four search paradigms, each the best of its kind for non adversary problems, are investigated. One is depth first, and the others best first.
Constraint Satisfaction
core
Learning constraint satisfaction problems: An ILP perspective
, 2016 We investigate the problem of learning constraint satisfaction problems from an inductive logic programming perspective. Constraint satisfaction problems are the underlying basis for constraint programming and there is a long standing interest in ...
Dries, Anton +3 more
core +1 more source
From Rigid to Soft Robotic Approaches for Neuroendoscopy
Advanced Robotics Research, EarlyView.Robotic assistance has had minimal impact on deep intraventricular surgeries, where small‐scale, precision, and reduced invasiveness can contribute to improved patient outcomes. Emerging technologies in rigid, soft, and hybrid robotics are reviewed to identify the most promising mechanisms for deep brain navigation in addition to an attempt to identify
Kieran Gilday +3 more
wiley +1 more source
Solving Form-Making Problems Using Shape Algebras and Constraint Satisfaction
, 1999 Shape grammars are well known approaches in design space exploration. This paper reviews the current work on shape grammars in design and suggests that considerable gains can be attained by integrating parametric shape grammar based design approaches ...
S. Emdanat, E.G. Vakalo, W. Birmingham
core