Results 191 to 200 of about 271 (223)
Reinforcement Learning With Timed Constraints for Robotics Motion Planning
Artificial Intelligence for Engineering, EarlyView.This work presents a unified automata‐based reinforcement learning framework that enforces MITL time‐bounded task specifications in both MDPs and POMDPs. Results from grid‐world and office scenarios show robust policy learning under stochastic dynamics and partial observability.
Zhaoan Wang +3 more
wiley +1 more source
Semi‐automated MicroED system unveils multiple polymorphs in fish‐derived guanine crystals
Acta Crystallographica Section C, EarlyView.A semi‐automated MicroED data collection and processing system was established and shown to be suitable for the structural investigation of submicrometer‐scale biogenic crystals.Certain fish display silvery or blue colour, not through pigments, but through specialized guanine crystals that exist within iridophore cells in their skin. Within these cells,
Minato Nakazawa +6 more
wiley +1 more source
Deep blueprint: A literature review and guide to automated image classification for ecologists
Journal of Animal Ecology, EarlyView.A practical, literature‐grounded review that gives ecologists a clear, modular workflow for deep learning image classification. With code, GUIs and a novel deep sea case study (automated deep sea biotope classification) it lowers technical barriers and provides a usable blueprint for accelerating, standardising, and scaling ecological image analysis ...
Chloe A. Game +2 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An introduction to unification grammars
Texts in Theoretical Computer Science, 1997In Part II we have developed a formal theory of parsing schemata for context-free grammars. In Part III we will apply this theory in several different directions. In Chapters 7–9, we discuss parsing schemata for unification grammars. In Chapters 10 and 11 we use parsing schemata to define Left-Corner and Head-Corner chart parsers.
Klaas Sikkel, Sikkel Klaas
exaly +2 more sources
On the Semantics of Unification Grammars
Grammars, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2011
Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors.
Nissim Francez, Shuly Wintner
openaire +2 more sources
Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors.
Nissim Francez, Shuly Wintner
openaire +2 more sources
Unification with Singleton Tree Grammars
2009First-order term unification is an essential concept in areas like functional and logic programming, automated deduction, deductive databases, artificial intelligence, information retrieval, compiler design, etc. We build upon recent developments in general grammar-based compression mechanisms for terms, which are more general than dags and investigate
Adrià Gascón +2 more
openaire +1 more source
Speech recognition in a unification grammar framework
International Conference on Acoustics, Speech, and Signal Processing, 2003The authors describe a stochastic unification grammar system that is a generalization of the conventional hidden Markov model (HMM) approach. Unification grammars concisely model context, providing a more powerful characterization of the acoustic data than the first-order Markov process.
Charles T. Hemphill, Joseph Picone
openaire +1 more source