Weighted Shortest Processing Time—Adjusted (WSPT-A) and
Approximate shortest paths in weighted graphs
... which is almost cubic. This result improved earlier barely sub-cubic algorithms dating back to the first such algorithm by Fredman [6]. When edge weights are integers, we are no longer restricted to the ...
6
Space-Time Adaptive Processing Based on Weighted Regularized Sparse Recovery
... penalty weighted scheme, we depict the average running time (second, s) for recovering one angle-Doppler profile in Table ...running time for recovering one angle-Doppler profile using CVX toolbox is ...
18
Shortest Path Problems Using Fuzzy Weighted Arc Length
... have considered T2WTpFN and T2WTrFN to find the FSP by dynamic programming. The problem is very complicated, and it contains various calculations concerning a large number of tables. This is the major drawback of the ...
8
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
... Breadth-first search allows us to calculate exhaustively the lengths of the shortest paths from every vertex on a graph to every other 共 if such a path exists 兲 in time O(mn). We have done this for each of ...
7
T2-adjusted computed diffusion-weighted imaging: A novel method to enhance tumour visualisation.
... Computed diffusion-weighted imaging (cDWI) has previously been proposed for achieving improved image contrast and signal-to-noise ratio (SNR) through the synthesis of images with arbitrary ‘diffusion weighting’ ...
20
On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
... 4 Variable Fixing Variable fixing is used for reducing the size of a problem. It is a pre-processing technique for tightening the formulation before the actual optimization. It consists on fixing some variables ...
12
A new formulation to the shortest path problem with time windows and capacity constraints
... We first compared three basic configurations. Con- figuration 1 uses the new model after applying pre- processing and domain reduction but no valid inequali- ties at all. Configuration 2 adds the valid ...
9
Efficient method for Online Shortest Path Computation on Time Dependent Networks
... accelerate processing of the set of designated routes specified by incessant route planning queries in the face of incoming traffic delay updates ...best shortest path and have run times an order of ...
6
Running time analysis of Ant Colony Optimization for shortest path problems
... Running time analysis Shortest path problems Ant Colony Optimization (ACO) is a modern and very popular optimization paradigm inspired by the ability of ant colonies to find shortest paths between ...
16
Spatio-Temporal Query Processing on Weighted Timestamp Data Environment
... for time series data, despite the importance of such ...reference time series that has the largest domain value at each time moment, such a reduction is often “far from satisfactory”; methods ...
7
Weighted gradient domain image processing problems and their iterative solutions
... elapse time until the error reaches to 10 −3 , and also the amount of required ...CPU time for the proposed solver are less than those of ...elapsed time of MILUC is much larger than others because ...
10
Similarity Search in Time Series Data Using Time Weighted Slopes
... is assigned a weight depending upon its location along the time axis. The technique being proposed involves some data pre-processing that enables it to handle variable length queries. It is also capable of ...
10
History-Adjusted Marginal Structural Models: Time-Varying Effect Modification
... Treatment Weighted (IPTW) estimator, which can be imple- mented using standard ...a weighted least squares estimator. For each time point j in the study, each subject receives a ...from time ...
14
Calculating disability-adjusted-life-years lost (DALYs) in discrete-time
... multiplied by this adjustment factor, and then discounted using the e -rt formulation. With this addition to the ana- lysis, YLL(3, 0) = 8.6394, which is the exact FRH answer. The analysis in Table 2 can also be ...
6
Weighted Shortest Common Supersequence problem revisited
... [21] introduced a problem called Weighted Consensus, which is a special case of the WSCS problem asking whether the WSCS of two weighted strings of length n is of length n, and they show[r] ...
18
Adjusted estimates for time-to-event endpoints.
... obtain adjusted curves that summarize the probability of failure for time-to-event endpoints that commonly occur in ...the adjusted curves change only with failures within the relevant group, and the ...
20
An Introduction to Time-weighted vs. Money-weighted Returns
... Return is essentially the change in value of your portfolio over time. If we ignore cash flows in or out of the account, it can simply be viewed as the gain or loss in market value relative to the beginning market ...
6
Time Weighted Return Example
... 1 Time line and beware for Example 1 Dollar-weighted coverage of return We also weigh the 100 initial money in food dollar amounts ...the time-weighted rate interest return using the formula ...
18
Power-Law Adjusted Failure-Time Models
... Index Terms—survival analysis; bathtub hazard; accelerated failure time (AFT) regression; power-law distribution. I. I NTRODUCTION Parametric distributions play an important role in the analysis of lifetime data ...
5
Optimization of Time-Weighted Average Air
... Effect of diffusion path length on recoveries of four analytes after sampling for 100,000 s using 23-ga 198. Car/PDMS fiber assembly[r] ...
13