Results 91 to 100 of about 92,871 (231)
Directed Acyclic Graph-Based Datapath Synthesis Using Graph Isomorphism and Gate Reconfiguration
Datapath synthesis is a crucial step in synthesis flow and aims at globally minimizing an area by identifying shareable logic structures. This paper introduces a novel Directed Acyclic Graph (DAG)-based datapath synthesis method based on graph ...
Liuting Shang +4 more
doaj +1 more source
IPC: A Benchmark Data Set for Learning with Graph-Structured Data [PDF]
Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and ...
Chen, Jie +4 more
core +1 more source
Vertical representation of $C^{\infty}$-words
We present a new framework for dealing with $C^{\infty}$-words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of $C^{\infty}$-words through an infinite directed acyclic graph $G$.
Fici, Gabriele, Fédou, Jean-Marc
core +2 more sources
From complexity to clarity: how directed acyclic graphs enhance the study design of systematic reviews and meta-analyses [PDF]
Stijntje Dijk +3 more
openalex +1 more source
Trajectory simplification has become a research hotspot since it plays a significant role in the data preprocessing, storage, and visualization of many offline and online applications, such as online maps, mobile health applications, and location-based ...
Fan Wu, Kun Fu, Yang Wang, Zhibin Xiao
doaj +1 more source
Personalized federated learning via directed acyclic graph based blockchain
Common federated learning (FL) lacks consideration of clients' personalized requirements, which performs poorly for the scenario with data and resource heterogeneity.
Chenglong Huang +7 more
doaj +1 more source
Conversational Aspect-based Sentiment Quadruple Analysis (DiaASQ) is a fine-grained sentiment analysis task that aims at extracting targets, aspects, opinions, and sentiments from multi-turn dialogues.
Qiang Zhang +3 more
doaj +1 more source
Cohesive Motion Control Algorithm for Formation of Multiple Autonomous Agents
This paper presents a motion control strategy for a rigid and constraint consistent formation that can be modeled by a directed graph whose each vertex represents individual agent kinematics and each of directed edges represents distance constraints ...
Debabrata Atta +2 more
doaj +1 more source
LCA Queries in Directed Acyclic Graphs [PDF]
We present two methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is surprisingly natural and solves the all-pairs LCA problem for the input dag on n vertices and m edges in time O(nm). As a corollary, we obtain an O(n2)-time algorithm for finding
Miroslaw Kowaluk, Andrzej Lingas
openaire +1 more source
A Boolean circuit is a collection of gates and wires that performs a mapping from Boolean inputs to Boolean outputs. The accepted wisdom is that such circuits must have acyclic (i.e., loop-free or feed-forward) topologies.
Bruck, Jehoshua, Riedel, Marc D.
core

