Results 101 to 110 of about 4,919,639 (299)
Multimode extensions of combinatorial optimization problems [PDF]
, 2016 We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the ...
Lulli, Guglielmo +3 more
core +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou +16 more
wiley +1 more source
Grobner Basis Approach to Some Combinatorial Problems [PDF]
Computer Science Journal of Moldova, 2012 We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express
Victor Ufnarovski
doaj
A Modified Multi-Level Hyper Heuristic for Tackling Combinatorial Optimization Problems [PDF]
IJCI International Journal of Computers and InformationHyper-heuristics are search techniques that operate on heuristic spaces by selecting low-level heuristics appropriately. Hyper-heuristic aims to generate a generalized and automated approaches to solve various problem domains.
Asmaa Awad +3 more
doaj +1 more source
Novelty and imitation within the brain: a Darwinian neurodynamic approach to combinatorial problems. [PDF]
Sci Rep, 2021 Czégel D +4 more
europepmc +1 more source
Approximation algorithms for combinatorial problems
Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73, 1973 Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value.
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To characterize the demographic, clinical, and laboratory features of the Chinese patients of genetic Creutzfeldt‐Jakob disease with T188K variant (T188K‐gCJD), the most common subtype of genetic prion diseases (gPrDs) in China. Methods In this nationwide retrospective study, data from 98 genetically confirmed T188K‐gCJD patients ...
Chun‐Jie Li +11 more
wiley +1 more source
Operations Research Perspectives, 2015 Many combinatorial optimization problems (COPs) encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized
Angel A. Juan +4 more
doaj +1 more source
Digital Cognitive Phenotyping for Differential Diagnosis and Monitoring in Neurological Conditions
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To assess the utility, accessibility, and equivalence to supervised scales of online cognitive assessment in older individuals with cognitive impairment. Methods Patients with Alzheimer's disease (AD, n = 31), idiopathic normal pressure hydrocephalus (iNPH, n = 26), and traumatic brain injury (TBI, n = 23) completed online cognitive ...
Martina Del Giovane +10 more
wiley +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source