• No results found

Some Worse than Linear Time Algorithms

Linear-Time Graph Algorithms in GP 2

Linear-Time Graph Algorithms in GP 2

... nodes than H 2 , or they have the same number of grey nodes but H 1 has more dashed edges, or they have the same number of grey nodes and dashed edges but H 1 has more red ...

23

Linear-time option pricing algorithms by combinatorics

Linear-time option pricing algorithms by combinatorics

... slowly. Worse, for some options like barrier options, the prices can even oscillate ...computational time are required to achieve acceptable ...derive linear-time pricing ...

16

On Near-Linear-Time Algorithms for Dense Subset Sum

On Near-Linear-Time Algorithms for Dense Subset Sum

... We also generalize our algorithm from sets to multi-sets, albeit with non-matching upper and lower bounds. 1 Introduction In the Subset Sum problem we are given a (multi-)set X of n positive integers and a target t and ...

20

A uniform Time Trade Off method for states better and worse than dead: feasibility study of the ‘lead time’ approach

A uniform Time Trade Off method for states better and worse than dead: feasibility study of the ‘lead time’ approach

... suggests some quite complex ...lead time TTO values, the latter being consistent with the theory that people with experience of ill health will have a greater understanding of adaptation and will value poor ...

32

A uniform Time Trade Off method for states better and worse than dead: feasibility study of the ‘lead time’ approach

A uniform Time Trade Off method for states better and worse than dead: feasibility study of the ‘lead time’ approach

... suggests some quite complex ...lead time TTO values, the latter being consistent with the theory that people with experience of ill health will have a greater understanding of adaptation and will value poor ...

32

Linear time parameterized algorithms for subset feedback vertex set

Linear time parameterized algorithms for subset feedback vertex set

... Lemma 5.5. Disjoint Subset FVS can be solved in time |T | O(k) (m + n). Proof. Let (G, T, k) be an instance to Disjoint Subset FVS . We solve the problem by a recursive branching algorithm. If there is no T -cycle ...

38

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

... concludes that the Hamiltonian path problem on distance-hereditary graphs can be solved in linear time. In the following, we will prove the above-mentioned lemmas and theorems together with some ...

30

The international diversification puzzle is not worse than you think

The international diversification puzzle is not worse than you think

... historical time period used to compute expected mean and ...at time t forecasting expected returns and covariance matrix using all information available at time ...have some degree of ...

36

Making Detailed Predictions Makes (Some) Predictions Worse

Making Detailed Predictions Makes (Some) Predictions Worse

... make worse winning team predictions because they are more likely to become fatigued or confused, or are more likely to stop paying attention to the prediction task than participants in the Winner ...the ...

227

The QALY is ableist: on the unethical implications of health states worse than dead

The QALY is ableist: on the unethical implications of health states worse than dead

... prevalence among patients can be assumed to be much higher, but detailed information on SWD is scarce. In some rare instances, SWD can be spotted directly by inspecting the economic model. To give but one example, ...

8

Linear Neurons and Their Learning Algorithms

Linear Neurons and Their Learning Algorithms

... If we limit the learning architecture to one layer, all of these algorithms have some advantages for some applications. The deep learning architectures currently provide the best solutions to many ...

14

When recursion is better than iteration : a linear time algorithm for acyclicity with few error vertices

When recursion is better than iteration : a linear time algorithm for acyclicity with few error vertices

... FPT algorithms for the compres- sion version than for the original ...the time required to compute an approximate solution and (b) the time required to solve the compression version of the ...

19

Some Algorithms on Cactus Graphs

Some Algorithms on Cactus Graphs

... a linear time algorithm for computing 2-NC problem for an interval ...a linear time algorithm for trapezoid graph has presented by Ghosh et ...nodes, some are leaf nodes and some ...

15

This Is Worse than the Fiduciary Rule

This Is Worse than the Fiduciary Rule

... least some of them, were planted 20 years ago, when several major life insurance companies decided to demutualize, cut costs, demobilize their captive agent forces, and rely on third-party ...

5

WORSE THAN SECOND-CLASS:

WORSE THAN SECOND-CLASS:

... a time—is inhumane. When used for longer than fifteen days, or on vulnerable populations such as children and people with mental illness, the practice is recognized by human rights experts as a form of ...

22

Statistics—worse than a poke in the eye?

Statistics—worse than a poke in the eye?

... Conclusions Our analysis permits us to draw several conclusions concerning effective pedagogy for service classes in statistics for science students. We have already mentioned the strategy of helping students become ...

6

Poor Estimates of Context are Worse than None

Poor Estimates of Context are Worse than None

... The first stage of correct finds candidate corrections, c, that differ from the typo t by a single insertion, deletion, substitution or reversal. For example, given [r] ...

5

Is Preventive Detention Morally Worse than Quarantine?

Is Preventive Detention Morally Worse than Quarantine?

... missed some argument that might be invoked in its defence—my discussion may put pressure on some particular arguments against preventive ...that some desert-based arguments against preventive ...

16

On some continuous time algorithms in optimization and game theory

On some continuous time algorithms in optimization and game theory

... Convex optimization and variational inequalities Equilibria in games Dissipative property Comparison: optimization/games Positive correlation No-regret dynamics Basic properties 1.. Dual[r] ...

75

Show all 10000 documents...

Related subjects