Results 81 to 90 of about 274,129 (290)

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, Zhaoting Li, Robert Babuška, Jens Kober, Cosimo Della Santina   +4 more
wiley   +1 more source

A Comparative Study for String Metrics and the Feasibility of Joining them as Combined Text Similarity Measures

ARO-The Scientific Journal of Koya University, 2017
This paper aims to introduce an optimized Damerau–Levenshtein and dice-coefficients using enumeration operations (ODADNEN) for providing fast string similarity measure with maintaining the results accuracy; searching to find specific words within a large
Safa S. Abdul-Jabbar, Loay E. George
doaj   +1 more source

Efficient quantum gates and algorithms in an engineered optical lattice

Scientific Reports, 2021
In this work, trapped ultracold atoms are proposed as a platform for efficient quantum gate circuits and algorithms. We also develop and evaluate quantum algorithms, including those for the Simon problem and the black-box string-finding problem.
A. H. Homid, M. Abdel-Aty, M. Qasymeh, H. Eleuch   +3 more
doaj   +1 more source

Lempel-Ziv Parsing in External Memory

, 2013
For decades, computing the LZ factorization (or LZ77 parsing) of a string has been a requisite and computationally intensive step in many diverse applications, including text indexing and data compression.
Kempa, Dominik, Kärkkäinen, Juha, Puglisi, Simon J.   +2 more
core   +1 more source

Approximation Algorithms for String Folding Problems [PDF]

, 2000
We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous context-free grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every ...
Giancarlo Mauri, Giulio Pavesi
openaire   +1 more source

AutomataGPT: Transformer‐Based Forecasting and Ruleset Inference for Two‐Dimensional Cellular Automata

Advanced Science, EarlyView.
We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich, Noah S. David, Markus J. Buehler   +2 more
wiley   +1 more source

PMS6MC: A Multicore Algorithm for Motif Discovery

Algorithms, 2013
We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran   +2 more
doaj   +1 more source

Machine Learning for Green Solvents: Assessment, Selection and Substitution

Advanced Science, EarlyView.
Environmental regulations have intensified demand for green solvents, but discovery is limited by Solvent Selection Guides (SSGs) that quantify solvent sustainability. Training a machine learning model on GlaxoSmithKline SSG, a database of sustainability metrics for 10,189 solvents, GreenSolventDB is developed. Integrated with Hansen solubility metrics,
Rohan Datta, Janhavi Nistane, Abhishek Sose, Harikrishna Sahu, Rampi Ramprasad   +4 more
wiley   +1 more source

Searching for Signatures of Cosmic Superstrings in the CMB

, 2009
Because cosmic superstrings generically form junctions and gauge theoretic strings typically do not, junctions may provide a signature to distinguish between cosmic superstrings and gauge theoretic cosmic strings.
A. Hanany, A. Lewis, A. Stewart, A. Vilenkin, A.A. Fraisse, C. Ringeval, E.J. Copeland, E.J. Copeland, J. Canny, K. Hashimoto, L. Leblond, M.B. Hindmarsh, M.G. Jackson, R.A. Battye, R.A. Battye, R.J. Danos, Rebecca J Danos, Robert H Brandenberger, S. Amsel, T.W.B. Kibble, T.W.B. Kibble, U. Seljak, Y.B. Zeldovich   +22 more
core   +1 more source

A Perspective on Interactive Theorem Provers in Physics

Advanced Science, EarlyView.
Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley   +1 more source