Results 51 to 60 of about 303 (159)

Multiobjective Environmental Cleanup with Autonomous Surface Vehicle Fleets Using Multitask Multiagent Deep Reinforcement Learning

open access: yesAdvanced Intelligent Systems, Volume 8, Issue 2, February 2026.
This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck   +4 more
wiley   +1 more source

Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]

open access: yes, 2017
INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core  

Palaeoglacier reconstruction and dynamics of Cordillera Vilcanota in the tropical high Peruvian Andes

open access: yesEarth Surface Processes and Landforms, Volume 51, Issue 2, February 2026.
We provide a geomorphological analysis of Cordillera Vilcanota and use morphostratigraphic principles to reconstruct palaeo icefield extent and palaeoglacier readvances, likely during the Antarctic Cold Reversal and Younger Dryas. We find evidence of temperate and polythermal ice margins, with limited glaciofluvial landform generation.
Bethan Davies   +11 more
wiley   +1 more source

On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree

open access: yes, 2022
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is
Dafik Dafik   +3 more
core   +1 more source

Neonate mortality in mountain caribou: Patterns of predation during onset of a wolf reduction program

open access: yesThe Journal of Wildlife Management, Volume 90, Issue 2, February 2026.
We used an individual‐based movement method, supported by camera trap data, to assess changes in neonate caribou mortality patterns before and after wolf reduction began in the Itcha‐Ilgachuz mountain caribou subpopulation range, British Columbia, Canada.
Tazarve Gharajehdaghipour   +2 more
wiley   +1 more source

Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph (〖AP〗_3)

open access: yes, 2023
Function if  is said to be k total rainbows in , for each pair of vertex  there is a path called  with each edge and each vertex on the path will have a different color.
Payu, Muhammad Rezky Friesta   +2 more
core   +1 more source

Evaluation of a novel anti‐mycotoxin agent specific for aquatic species in mitigating aflatoxin B1‐induced changes in Nile tilapia: A comprehensive study

open access: yesJournal of the World Aquaculture Society, Volume 57, Issue 1, February 2026.
Abstract Aflatoxin B1 (AFB1) contamination of aquaculture feed poses serious health risks to fish and consumers. In this study, the efficacy of a novel anti‐mycotoxin agent specific for aquatic species (AM‐AQ) containing bentonite, sepiolite, and orange peel meal (Citrus Sinensis) in alleviating AFB1 toxicity in Nile tilapia (Oreochromis niloticus) was
Eman Zahran   +12 more
wiley   +1 more source

Generalized Rainbow Connection of Graphs and their Complements

open access: yes, 2018
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang   +3 more
core   +2 more sources

On rainbow vertex antimagic coloring and its application to the encryption keystream construction [PDF]

open access: yes
Let G = (V,E) be a graph that is a simple, connected and un-directed graph. We now introduce a new notion of rainbow vertex antimagic coloring. This is a proper development of antimagic labeling with rainbow vertex coloring.
Nagaraja, Vaishnavi   +6 more
core   +1 more source

Rainbow K-Connection In Dense Graphs

open access: yes, 2011
An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G , there are k internally vertex-disjoint paths joining them, each of which is rainbow (i.e., all edges of each path have distinct colours).
Liu, Henry   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy