Results 211 to 220 of about 104,170,946 (255)
Exploiting Edge Semantics in Job Shop Scheduling Problem With Heterogeneous Graph Transformers
A heterogeneous graph transformer (HGT) is introduced for reinforcement learning‐based job shop scheduling by explicitly distinguishing precedence and machine‐contention relations through edge‐type‐specific attention. The proposed framework learns richer scheduling representations, improves decision quality over homogeneous graph models, and highlights
Bulent Soykan, Fatih Kasimoglu
wiley +1 more source
An large language model‐powered multimodal framework is developed for robotic endoscope control. It integrates speech recognition and real‐time instrument tracking, achieving 89.47% command accuracy with ~1s latency for natural human–robot interaction in minimally invasive surgery.
Yisen Huang +7 more
wiley +1 more source
Secure Fusion‐X harmonizes unstructured NVD descriptions with structured CVSS/CWE/CPE metadata via decision‐level fusion, overcoming the fragility of traditional unimodal models. Automated assessment of software vulnerability exploitability is essential for intelligent cyber defense, yet its effectiveness is often hindered by unstable, delayed, or ...
Mona Dolati +3 more
wiley +1 more source
Vernacular Futurism: How Persian Language Users Imagine AI
ABSTRACT Public discourse about artificial intelligence increasingly unfolds through compressed forecasts, moral warnings, and everyday speculation circulating at platform speed. This study examines how Persian language users on X construct and contest AI futures, analyzing a corpus of 4741 posts collected between January 2023 and December 2025, with ...
Arthur Asa Berger, Ehsan Shahghasemi
wiley +1 more source
Responsible Artificial Intelligence in Courts: A Four‐Test Framework
ABSTRACT A structured framework for responsible AI applications relating to judicial decision‐making and the adjudicative functions of courts requires the satisfaction of multiple context‐specific safeguards. This article proposes a four‐test framework designed to evaluate whether AI systems used in courts operate in accordance with legal, procedural ...
Kwan Yiu Cheng
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Semantics for Means-end Relations
Synthese, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hughes, J. (author) +2 more
openaire +3 more sources
1988
It is common to consider a program as a relation on the set of its possible states. The relational equations describing the behavior of programs can be object level, i.e., they refer to states and values of variables, or they can be relation level, i.e., the constants and variables in the equations range over relations. Relation level work using binary
Jules Desharnais, Nazim H. Madhavji
openaire +2 more sources
It is common to consider a program as a relation on the set of its possible states. The relational equations describing the behavior of programs can be object level, i.e., they refer to states and values of variables, or they can be relation level, i.e., the constants and variables in the equations range over relations. Relation level work using binary
Jules Desharnais, Nazim H. Madhavji
openaire +2 more sources
Tabular Expressions and Their Relational Semantics
Fundamenta Informaticae, 2005Tabular Expressions (Parnas et al. [20, 28, 32, 33]) are means to represent the complex relations that are used to specify or document software systems. A formal model and a semantics for tabular expressions are presented. The model covers most known types of tables used in software engineering, and admits precise classification and definition of new ...
Ryszard Janicki, Alan Wassyng
openaire +3 more sources
Semantic distance and the verification of semantic relations
Journal of Verbal Learning and Verbal Behavior, 1973Four experiments dealt with the verification of semantic relations. In Experiment I, subjects decided whether an instance was a member of a specified category. For some categories (for example, birds) verification was faster when the target category was a direct superordinate (bird) than a higher level superordinate (animal), while for another category
Lance J. Rips +2 more
openaire +1 more source
A Semantics for Relational Programming
1992This paper presents an elementary model of relational programming as a generalisation of functional programming. We present well-known models of features of functional programming and show one way that they generalise to the relational case. This is achieved by giving a uniform construction of a category of types and relations from a category of types ...
openaire +2 more sources

