Results 111 to 120 of about 43,821 (313)
In the Maze of Data Languages [PDF]
, 2012 In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the ...
D'Antoni, Loris
core
A Task and Motion Planning Framework for Partially Observable Household Manipulation Scenes
Advanced Intelligent Systems, EarlyView.This paper presents a novel TAMP framework tackling partial observability, cluttered scenes, and vague goals via symbolic reasoning and occlusion‐aware planning. It outperforms prior learning, policy, and LLM‐based methods in six real and simulated household tasks.
Yuhong Ma +3 more
wiley +1 more source
Decompositions of Grammar Constraints [PDF]
, 2008 A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive constraints.
Quimper, Claude-Guy, Walsh, Toby
core +1 more source
On Measuring Non-Recursive Trade-Offs
, 2009 We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.
A. Malcher +29 more
core +4 more sources
Intelligent Supportive System for People with Profound Intellectual and Multiple Disabilities
Advanced Intelligent Systems, EarlyView.A holistic INSENSION system is developed—a novel intelligent decision support system leveraging state‐of‐the‐art noninvasive audio‐visual sensor technologies together with machine learning algorithms and expert knowledge, to detect and interpret behaviors and communications (nonverbal signals—NVSs) of people with PIMD in challenging real‐world ...
Gašper Slapničar +10 more
wiley +1 more source
Generalized Results on Monoids as Memory
, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
D'Alessandro, Flavio +2 more
core +1 more source
An Integrated and Flexible Humidity Sensor for Noncontact Handwriting Recognition
Advanced Intelligent Systems, EarlyView.A noncontact handwriting recognition system is fabricated by directly integrating a 4 × 4 flexible humidity sensing array and a designed flexible sampling circuit. Assisted with a CNN model, the handwriting recognition system can realize the recognition of handwriting digits 1–9 with an average accuracy of 98.67%.
Yu Xiao, Jingjing Yao, Shujuan Zhu
wiley +1 more source
ChatMolData: A Multimodal Agent for Automatic Molecular Data Processing
Advanced Intelligent Systems, EarlyView.While large language models (LLMs) struggle with molecular data due to single‐modality limitations, ChatMolData—a multimodal agent for processing databases, images, structure files, and documents—is presented. It combines LLMs with tools for retrieval, structuring, prediction, visualization, and search, achieving > 90% accuracy across 128 tasks.
Yi Yu +5 more
wiley +1 more source
Extending the scalars of minimizations [PDF]
, 2001 In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\Sigma^*$ where $\Sigma$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct $\K$-subsets of $\
Duchamp, Gérard, +2 more
core +2 more sources