Results 41 to 50 of about 3,747,631 (288)
Efficient Solution of Language Equations Using Partitioned Representations [PDF]
, 2007 A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification.
Alan Mishchenko +5 more
core +1 more source
EviPlant: An efficient digital forensic challenge creation, manipulation and distribution solution
, 2017 Education and training in digital forensics requires a variety of suitable challenge corpora containing realistic features including regular wear-and-tear, background noise, and the actual digital traces to be discovered during investigation.
Du, Xiaoyu, Lillis, David, Scanlon, Mark
core +1 more source
A PARALLEL LOOP SCHEDULING ALGORITHM BASED ON THE SMARANDACHE f-INFERIOR PART FUNCTION [PDF]
, 2000 This article presents an application of the inferior Smarandache f-part function to a particular parallel loop-scheduling problem. The product between an upper diagonal matrix and a vector is analysed from parallel computation point of view. An efficient
Tabirca, Sabin, Tabirca, Tatiana
core +1 more source
Communication and Language Profiles of Children Treated for Posterior Fossa Brain Tumors
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Cognitive and language deficits are frequently reported sequelae of posterior fossa brain tumors (PFBT). Typically, delayed onset impedes prompt assessment and early intervention. This has devastating implications for quality of life.
Zara Sved +4 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The HIT network was established in 2000 to create a population‐based structure aiming to improve survival rates and reduce late effects for children with central nervous system (CNS) tumors by conducting comprehensive clinical trials.
Stefan Rutkowski +59 more
wiley +1 more source
Time-Dependent Restoration Routing Problem: An Efficient Initial Solution
Findings, 2022 We propose a time-dependent variant of the restoration routing problem scheduling restoration tasks for each crew given a limited time horizon. The model provides a feasible initial solution for real-world restoration crew routing problems.
Saviz Saei, Nazanin Tajik
doaj +1 more source
An Efficient Policy Iteration Algorithm for Dynamic Programming Equations [PDF]
, 2013 We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many ...
Alla, Alessandro +2 more
core +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Characterizing stressful events reported by childhood cancer survivors experienced throughout the lifespan may help improve trauma‐informed care relevant to the survivor experience. Methods Participants included 2552 survivors (54% female; 34 years of age) and 469 community controls (62% female; 33 years of age) from the St.
Megan E. Ware +13 more
wiley +1 more source
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem [PDF]
Computer Science Journal of Moldova, 2002 We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained.
Vladimir A. Emelichev +2 more
doaj +2 more sources
An efficient confidentiality protection solution for pub/sub system
Cybersecurity, 2023 Publish/subscribe(pub/sub) systems are widely used in large-scale messaging systems due to their asynchronous and decoupled nature. With the population of pub/sub cloud services, the privacy protection problem of pub/sub systems has started to emerge ...
Jinglei Pei +7 more
doaj +1 more source