Results 191 to 200 of about 35,760 (258)

Suffixient Arrays: A New Efficient Suffix Array Compression Technique. [PDF]

Theory Comput Syst
Cenzato D, Depuydt L, Gagie T, Kim SH, Manzini G, Olivares F, Prezza N.   +6 more
europepmc   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

An extended target tracking algorithm based on trajectory feedback constrained spatial information. [PDF]

PLoS One
Zhang Y, Li H, Li J.
europepmc   +1 more source

Simultaneous Network Design With Restricted Link Usage

Networks, EarlyView.
ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura, Péter Madarasi, Jannik Matuschke, Kitti Varga   +3 more
wiley   +1 more source

Community detection in hypergraphs through hyperedge percolation. [PDF]

Sci Rep
Kovács B, Benedek B, Palla G.
europepmc   +1 more source

Paroxysmal Kinesigenic Dyskinesia and Progressive Ataxia‐Spasticity Syndrome Caused by a Biallelic Variant in KCNJ10

Movement Disorders Clinical Practice, EarlyView.
Clément Desjardins, Jiyoon Baik, Lorenzo Bresciani, Christelle Nilles, Cendrine Foucard, Mathieu Georget, Lina Daghsen, Bertrand Degos, Aurélie Méneret, Emmanuel Roze   +9 more
wiley   +1 more source

Exact Methods for the Cumulative Capacitated Vehicle Routing Problem With Time Windows

Networks, EarlyView.
ABSTRACT This article studies the cumulative capacitated vehicle routing problem with time windows (CCVRPTW). The CCVRPTW consists of deciding the routing schedules for a set of homogeneous capacitated vehicles such that the latency, that is, the sum of the service start times at the customers, is minimized and the time windows as well as the vehicle ...
Alan Osorio‐Mora, Timo Gschwind
wiley   +1 more source

Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases. [PDF]

PLoS One
Le N, Vo H, Nguyen T.
europepmc   +1 more source

On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)

Networks, EarlyView.
ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs, Martina Cerulli, Carmine Sorgente   +2 more
wiley   +1 more source