Results 41 to 50 of about 16,940,234 (305)

A Multi-Phase Method for Euclidean Traveling Salesman Problems

open access: yesAxioms, 2022
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia   +3 more
doaj   +1 more source

Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data

open access: yesAlgorithms, 2022
Background: The technological revolution has allowed users to exchange data and information in various fields, and this is one of the most prevalent uses of computer technologies.
Abidemi Emmanuel Adeniyi   +3 more
doaj   +1 more source

Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines

open access: yesMathematics, 2021
We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job.
Nodari Vakhania, Frank Werner
doaj   +1 more source

Strategic Policymaking within Complex Timescapes [PDF]

open access: yes, 2021
The complex interactions of social life serve to structure in time the opportunities, threats, and constraints that confront different social actors.
Room, Graham
core   +1 more source

Teaching Complexity and Its Practical Implications in Leadership Development Programs

open access: yes, 2018
This article describes an advanced leadership seminar for senior managers and executives. The three module seminar describes how thoughtful leaders can learn to succeed even under conditions of extreme complexity. The first module describes complexity in
Hazy, James K
core   +1 more source

Complexity Framework for Forbidden Subgraphs [PDF]

open access: yes, 2022
For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph ...
Oostveen, Jelle   +8 more
core   +2 more sources

Complexity, Governance and Networks: Introduction to the Inaugural Issue

open access: yes, 2014
From the introduction: 1. Yet Another Journal? Why is it necessary to publish a new journal about complexity, governance, and networks? There has been an increasing interest in complexity, governance, and network studies in recent decades.
Morçöl, Göktuğ   +2 more
core   +1 more source

Teaching Complexity: The Limits of Evidence and the ‘Prospective’ Case Study [PDF]

open access: yes, 2018
Policy practitioner–students in a Master of Public Policy programme in New Zealand describe many problems and processes in their work environments as ‘complex’.
Wolf, Amanda, Amanda Wolf
core   +1 more source

An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers

open access: yesBig Data and Cognitive Computing
Data structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications.
Wei-Chang Yeh, Majid Forghani-elahabad
doaj   +1 more source

Evidence‐Informed Multidisciplinary Consensus Guidance for the Psychosocial Care of Adolescents With High‐Risk Cancer: Recommendations From the Italian Association of Pediatric Hematology and Oncology

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Adolescents with high‐risk cancer face complex developmental, psychosocial, and ethical challenges that extend beyond disease‐directed treatment. Although international recommendations exist for communication, psychosocial care, pediatric palliative care, survivorship, and shared decision‐making, these have largely evolved within ...
Johanna M. C. Blom   +15 more
wiley   +1 more source

Home - About - Disclaimer - Privacy