Results 131 to 140 of about 34,025 (156)
Some of the next articles are maybe not open access.
Toward a complexity theory for randomized search heuristics : black-box models
2011Randomized search heuristics are a broadly used class of general-purpose algorithms. Analyzing them via classical methods of theoretical computer science is a growing field. While several strong runtime bounds exist, a powerful complexity theory for such algorithms is yet to be developed. We contribute to this goal in several aspects.
openaire +2 more sources
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
A new MIP Heuristic based on Randomized Neighborhood Search
2011A new simple MIP heuristic, called Randomized Neighborhood Search (RANS) is proposed, whose purpose is to produce within short time bounds high quality solutions especially for large size MIP problems as the ones characterizing real industrial applications.
ANGHINOLFI, DAVIDE, PAOLUCCI, MASSIMO
openaire +1 more source
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Decomposition of Fitness Functions in Random Heuristic Search
2007Yossi Borenstein, Riccardo Poli
openaire +1 more source
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly
American Cancer Society Head and Neck Cancer Survivorship Care Guideline
Ca-A Cancer Journal for Clinicians, 2016Nader Sadeghi +2 more
exaly