Results 111 to 120 of about 22,643,313 (377)

The Complexity of Mean Flow Time Scheduling Problems with Release Times

, 2006
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.
Baptiste, Philippe, Brucker, Peter, Chrobak, Marek, Durr, Christoph, Kravchenko, Svetlana A., Sourd, Francis   +5 more
core   +3 more sources

Complexitor: An Educational Tool for Learning Algorithm Time Complexity in Practical Manner

, 2017
Based on the informal survey, learning algorithm time complexity in a theoretical manner can be rather difficult to understand. Therefore, this research proposed Complexitor, an educational tool for learning algorithm time complexity in a practical ...
E. Elvina, Oscar Karnalim
semanticscholar   +1 more source

Cyclic nucleotide signaling as a drug target in retinitis pigmentosa

FEBS Letters, EarlyView.
Disruptions in cGMP and cAMP signaling can contribute to retinal dysfunction and photoreceptor loss in retinitis pigmentosa. This perspective examines the mechanisms and evaluates emerging evidence on targeting these pathways as a potential therapeutic strategy to slow or prevent retinal degeneration.
Katri Vainionpää, Ahmed B. Montaser, Henri Leinonen   +2 more
wiley   +1 more source

Level Based Routing Using Dynamic Programming for 2D Mesh

Cybernetics and Information Technologies, 2017
The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm.
Punhani Akash, Kumar Pardeep, Nitin Nitin   +2 more
doaj   +1 more source

Path Independence in Adiabatic Quantum Computing for Hadamard Gate

Journal of Mathematical and Fundamental Sciences, 2014
The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih, Suhadi, Freddy Permana Zen   +2 more
doaj   +1 more source

TRAF2 binds to TIFA via a novel motif and contributes to its autophagic degradation

FEBS Letters, EarlyView.
TRAF family members couple receptor signalling complexes to downstream outputs, but how they interact with these complexes is not always clear. Here, we show that during ADP‐heptose signalling, TRAF2 binding to TIFA requires two short sequence motifs in the C‐terminal tail of TIFA, which are distinct from the TRAF6 binding motif.
Tom Snelling, Kodi Hunter, Celest W. S. Tay, Nicola T. Wood, Philip Cohen   +4 more
wiley   +1 more source

Leveraging Metaheuristics for Feature Selection With Machine Learning Classification for Malicious Packet Detection in Computer Networks

IEEE Access
Robust Intrusion Detection Systems (IDS) are increasingly necessary in the age of big data due to the growing volume, velocity, and variety of data generated by modern networks.
Aganith Shanbhag, Shweta Vincent, S. B. Bore Gowda, Om Prakash Kumar, Sharmila Anand John Francis   +4 more
doaj   +1 more source

The epithelial barrier theory proposes a comprehensive explanation for the origins of allergic and other chronic noncommunicable diseases

FEBS Letters, EarlyView.
Exposure to common noxious agents (1), including allergens, pollutants, and micro‐nanoplastics, can cause epithelial barrier damage (2) in our body's protective linings. This may trigger an immune response to our microbiome (3). The epithelial barrier theory explains how this process can lead to chronic noncommunicable diseases (4) affecting organs ...
Can Zeyneloglu, Huseyn Babayev, Ismail Ogulur, Sena Ardicli, Yagiz Pat, Duygu Yazici, Bingjie Zhao, Lihong Chang, Xiaoqing Liu, Paolo D'Avino, Manru Li, Ceren Biçer, Fatma Hacer Kurtoğlu Babayev, Raja Dhir, Kari C. Nadeau, Marie‐Charlotte Brüggen, Mubeccel Akdis, Cezmi A. Akdis   +17 more
wiley   +1 more source

Maximum entropy searching

CAAI Transactions on Intelligence Technology, 2018
This study presents a new perspective for autonomous mobile robots path searching by proposing a biasing direction towards causal entropy maximisation during random tree generation.
Rui Jiang, Hui Zhou, Hui Zhou, Han Wang, Shuzhi Sam Ge   +4 more
doaj   +1 more source

Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks

, 2007
The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices.
Rajan, B. Sundar, Rajan, G. Susinder
core   +1 more source