Results 41 to 50 of about 4,184,946 (299)

Reduction of Phase Shifters in Planar Phased Arrays Using Novel Random Subarray Techniques

open access: yesApplied Sciences
Reducing the number of phase shifters by grouping antenna elements into subarrays has been extensively studied for decades. The number of phase shifters directly affects the cost, complexity, and power consumption of the system.
Juan L. Valle   +4 more
doaj   +1 more source

Probability-boosting technique for combinatorial optimization [PDF]

open access: yesPeerJ Computer Science
In many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj   +2 more sources

RANDOMIZED ALGORITHMS FOR MOTIF DETECTION [PDF]

open access: yesJournal of Bioinformatics and Computational Biology, 2005
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g. locating binding sites regulatory signals, designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software tool.
Lusheng Wang 0001, Liang Dong
openaire   +2 more sources

Association Between Individualized Education for Kidney Replacement Therapy Modality Selection and Peritoneal Dialysis Initiation: A Cross‐Sectional Study

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito   +7 more
wiley   +1 more source

Randomized Speedup of the Bellman-Ford Algorithm [PDF]

open access: yes, 2011
We describe a variant of the Bellman–Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each pass of the ...
David Eppstein   +3 more
core  

Fibonacci Tessellation for Optimizing Planar Phased Arrays in Satellite Communications

open access: yesTechnologies
This article presents a novel strategy for the design of planar phased arrays using Fibonacci-based partitioning combined with a random multi-objective search.
Juan L. Valle   +5 more
doaj   +1 more source

Randomized and Optimal Algorithms for k-Lifetime Dominating Set in Wireless Sensor Networks

open access: yesIEEE Access, 2022
In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time.
Weizhong Luo, Junbin Liang, Tianshu Wang
doaj   +1 more source

A Randomized Algorithm for 3-SAT [PDF]

open access: yesMathematics in Computer Science, 2010
In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is ...
Subhas Kumar Ghosh, Janardan Misra
openaire   +4 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

A randomized algorithm for large scale support vector learning

open access: yes, 2007
We propose a randomized algorithm for large scale SVM learning which solves the problem by iterating over random subsets of the data. Crucial to the algorithm for scalability is the size of the subsets chosen.
Kumar, Krishnan   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy