Results 61 to 70 of about 4,101,702 (289)
Search and Knowledge in Lines of Action [PDF]
, 2004 This paper describes the design and development of two world-class Lines of Action game-playing programs: YL, a three time Computer Olympiad gold-medal winner, and Mona, which has dominated international e-mail correspondence play. The underlying design philosophy of the two programs is very different: the former emphasizes fast and efficient search ...
Darse Billings, Yngvi Björnsson
openaire +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Inspired by the diverse set of technologies used in underground object detection and imaging, we introduce a novel multimodal linear search problem whereby a single searcher starts at the origin and must find a target that can only be detected when the searcher moves through its location using the correct of $p$ possible search modes.
Jared Ray Coleman +4 more
openaire +2 more sources
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
MathematicsUnconstrained optimization problems have a long history in computational mathematics and have been identified as being among the crucial problems in the fields of applied sciences, engineering, and management sciences. In this paper, a new variant of the
Aliyu Muhammed Awwal +3 more
doaj +1 more source
Line search for generalized alternating projections [PDF]
2017 American Control Conference (ACC), 2017 This paper is about line search for the generalized alternating projections (GAP) method. This method is a generalization of the von Neumann alternating projections method, where instead of performing alternating projections, relaxed projections are alternated. The method can be interpreted as an averaged iteration of a nonexpansive mapping. Therefore,
Mattias Fält, Pontus Giselsson
openaire +2 more sources
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
A Combined Cubic and Novel Line Search CG-Algorithm [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2012 In this paper a new line search technique is investigated. It uses (cubic and novel) line searches in the standard CG-algorithm for unconstrained optimization.
Abbas Al-Bayati, Hamsa Chilmerane
doaj +1 more source
Line and cell searching in tables or forms [PDF]
, 1995 Item searching is an important step in form analysis. The goal of this paper is to describe a robust method to locate the items whose boundaries are black lines, and an algorithm to classify those items. Our method is based on detection of lines by Hough transform and on searching of cycles in a graph that represents the cells (boundaries of the items).
Turolla, Eric +2 more
openaire +2 more sources
A distributed line search for network optimization [PDF]
2012 American Control Conference (ACC), 2012 8 pages, 2 figures.
Michael Zargham +2 more
openaire +2 more sources