Results 81 to 90 of about 38,008 (262)

Aplikasi Algoritma Semut Dalam Menentukan Pohon Merentang Minimum (Minimum Spanning Tree) Terhadap Lintasan yang Mengarah ke Pusat Perbelanjaan di Kota Palopo

open access: yesInfinity Jurnal Matematika dan Aplikasinya, 2020
Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj  

PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n

open access: yesAksioma: Jurnal Program Studi Pendidikan Matematika, 2018
This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj   +1 more source

A Geometrically Transient Platform for Bioelectronic Implants

open access: yesAdvanced Materials, EarlyView.
Minimally invasive bioelectronic implants often compromise performance for smaller sizes. To resolve this optimization dilemma, a wireless bioelectronic implant with a transient geometry is introduced (MiFi). The origami‐inspired device miniaturizes up to sixfold for syringe insertion and autonomously unfolds post‐implantation.
Selin Olenik   +13 more
wiley   +1 more source

Electrically Coded Retinomorphic Spectrophotodetector

open access: yesAdvanced Materials, EarlyView.
Self‐powered retinomorphic pyro‐photodetector is demonstrated that avoids machine‐learning post‐processing and covers 365–940 nm. Electrostatic balancing of built‐in potential produces an electrical wavelength code, delivering <3 nm wavelength decoding accuracy with ∼46 µs response.
Mohit Kumar, Hyunmin Dang, Hyungtak Seo
wiley   +1 more source

Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases

open access: yesEAI Endorsed Transactions on Energy Web, 2016
We present an average case analysis of the minimum spanning tree heuristic for the power assignment problem. The worst-case approximation ratio of this heuristic is 2.
Maurits de Graaf   +3 more
doaj   +1 more source

Unveiling α‐MoO3 as a High‐Index, Low‐Loss Anisotropic Material: Bridging the Gap From Mid‐Infrared to Ultraviolet Nanophotonics

open access: yesAdvanced Materials, EarlyView.
α‐MoO3 is established as a high‐index, low‐loss anisotropic platform bridging mid‐infrared polaritonics and ultraviolet‐visible nanophotonics. Spectroscopic ellipsometry and calculations reveal refractive indices exceeding 3.9, with the largest in‐plane birefringence among transparent layered crystals at 425–500 nm, enabling zero‐order UV waveplates ...
Adilet N. Toksumakov   +14 more
wiley   +1 more source

An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem

open access: yesMathematics, 2018
Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications.
Tamer F. Abdelmaguid
doaj   +1 more source

From Payload‐First Toward Dual‐Mechanism Antibody–Drug Conjugates

open access: yesAdvanced Materials, EarlyView.
Conjugation converts potent antibodies into underexposed carriers. This perspective defines the antibody exposure deficit and maps a mechanism‐first design space from payload‐first to antibody‐first ADC architectures, integrating DAR, linker chemistry, and Fc engineering to guide rational design of constructs that balance targeted cytotoxicity with ...
Xavier Pivot   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy