Results 81 to 90 of about 1,090,569 (315)
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence, 2014 Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build a model of the algorithm's runtime as a function of problem-specific instance features. Such models have important applications to algorithm analysis, portfolio-based algorithm selection, and ...
Frank Hutter +3 more
openaire +4 more sources
Genetic Algorithms: Genesis of Stock Evaluation [PDF]
The uncertainty of predicting stock prices emanates pre-eminent concerns around the functionality of the stock market. The possibility of utilising Genetic Algorithms to forecast the momentum of stock price has been previously explored by many ...
Rama Prasad Kanungo
core
Explicit memory schemes for evolutionary algorithms in dynamic environments
, 2007 Copyright @ 2007 Springer-VerlagProblem optimization in dynamic environments has atrracted a growing interest from the evolutionary computation community in reccent years due to its importance in real world optimization problems.
Yang, S +2 more
core +1 more source
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Algorithm Development of Temperature and Humidity Profile Retrievals for Long-Term HIRS Observations
Remote Sensing, 2016 A project for deriving temperature and humidity profiles from High-resolution Infrared Radiation Sounder (HIRS) observations is underway to build a long-term dataset for climate applications.
Lei Shi +4 more
doaj +1 more source
Algorithm Dynamics Analysis Method
Journal of Computers, 2010 The concepts of algorithm dynamics are proposed. Simulated annealing algorithm is analyzed by algorithm dynamics method. In the optimization progress metropolis criteria acts as an important role to construct simulated annealing algorithm. The metropolis criteria leads algorithm system to the ground state.
openaire +1 more source
, 2010 By focusing on hybrid diffusions in which continuous dynamics and discrete events coexist, this work is concerned with approximation of solutions for hybrid stochastic differential equations with a state-dependent switching process.
Yuan, Chenggui +7 more
core +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
A Divisive Initialisation Method for Clustering Algorithms [PDF]
, 1999 A method for the initialisation step of clustering algorithms is presented. It is based on the concept of cluster as a high density region of points. The search space is modelled as a set of d-dimensional cells. A sample of points is chosen and located into the appropriate cells.
Pizzuti Clara +2 more
openaire +2 more sources
MITF maintains genome stability in nonmelanocyte lineages
Molecular Oncology, EarlyView.MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source