Results 111 to 120 of about 6,708,930 (288)
Data‐Driven Materials Science for Energy‐Sustainable Applications
Advanced Materials, EarlyView.Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley +1 more source
A Low-Cost Consistent Vehicle Localization Based on Interval Constraint Propagation
Journal of Advanced Transportation, 2018 Probabilistic techniques (such as Extended Kalman Filter and Particle Filter) have long been used to solve robotic localization and mapping problem. Despite their good performance in practical applications, they could suffer inconsistency problems.
Zhan Wang, Alain Lambert
doaj +1 more source
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
A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem [PDF]
We describe a genetic algorithm for the partial constraint satisfaction problem. The typical elements of a genetic algorithm, selection, mutation and cross-over, are filled in with combinatorial ideas.
Kolen, Antoon
core
Closed‐Loop Solid‐State Synthesis Planning for Materials Discovery With Large Language Models
Advanced Materials, EarlyView.Leveraging literature data, we build a large‐language‐model‐driven workflow that extracts synthesis steps from 4407 papers, retrieves similar precedents, and generates candidate solid‐state synthesis recipes. The system benchmarks against ground‐truth and then operates in a closed loop with experiments to synthesize oxy‐selenide electrolyte materials ...
Dong Won Jeon +9 more
wiley +1 more source
A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark
Applied Sciences, 2018 Frequent subgraph mining (FSM) plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks.
Fengcai Qiao +5 more
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
Dominion : an architecture-driven approach to generating efficient constraint solvers [PDF]
, 2011 This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines.
Balasubramaniam, Dharini +11 more
core +1 more source
Transient Cytoskeletal Anisotropy Encodes Short‐Term Mechanical Memory in Glioblastoma Cells
Advanced Materials, EarlyView.The same mechanical deformation can produce distinct cytoskeletal states depending on loading history. Experiments and constitutive modeling reveal that transient actin–vimentin anisotropy stores mechanical information and governs short‐term mechanical memory in glioblastoma cells.
Clara Gomez‐Cruz +5 more
wiley +1 more source
International Journal of Advanced Robotic Systems, 2018 This work addresses the combination of a symbolic hierarchical task network planner and a constraint satisfaction solver for the vehicle routing problem in a multi-robot context for structure assembly operations.
Jorge Muñoz-Morera +3 more
doaj +1 more source