• No results found

A linear time algorithm for simple QP

Linear-Time Algorithm for Quantum 2SAT

Linear-Time Algorithm for Quantum 2SAT

... The high level description of the procedure for 2-SAT is relatively simple. Let us suppose that our formula φ only contains clauses with two literals. Pick an arbitrary unassigned variable x i and assign x i = 0. ...

27

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

... the algorithm is linear. Indeed, L 4 (G) can be computed in linear time ...and Algorithm 2 is called O(n) times, and, as already noted, has constant ...the algorithm, so here we ...

27

A Simple And Novel Algorithm For State Estimation Of Continuous Time Linear Stochastic Dynamic Systems Excited By Random Inputs

A Simple And Novel Algorithm For State Estimation Of Continuous Time Linear Stochastic Dynamic Systems Excited By Random Inputs

... estimation algorithm for continuous time dynamic system under the lossy environment without increasing the complexity of hardware ...continuous time system provides effective estimation with data ...

5

Linear-time superbubble identification algorithm for genome assembly

Linear-time superbubble identification algorithm for genome assembly

... is represented as a directed edge between its prefix and suffix vertices. The marginal information contained by a k-mer is its last nucleotide. The sequence of those final nucleotides is called the sequence of the vertex. In ...

10

A Linear-Time Algorithm for k-partitioning Doughnut Graphs

A Linear-Time Algorithm for k-partitioning Doughnut Graphs

... constant time during one exe- cution of Hamiltonian path finding algorithm and hence the algorithm runs in linear time, the linear-time im- plementation of the ...

6

A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity

A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity

... Three trials are done for each algorithm on each dimension. Two population sizes are tested: λ = 4 + ⌊3 ln n⌋ and λ = 2n. Experiments were performed on a single (no hyper-threading) Intel Core 2 processor 2.66GHz ...

11

A Linear Time Algorithm for Pricing European Sequential Barrier Options

A Linear Time Algorithm for Pricing European Sequential Barrier Options

... 1 Introduction Financial derivatives are contracts concerning rights and obligations to buy or sell certain underlying finan- cial assets during some specified period. Option con- tracts are one simple kind of ...

8

A linear time approximation algorithm for permutation flow shop scheduling

A linear time approximation algorithm for permutation flow shop scheduling

... and time complexity Θ ( nm ) ...approximation algorithm already obtained for the PFS, achieving the same approximation factor as in [ 9 ] in linear time ...a simple job sorting ...

8

A fully linear-time approximation algorithm for grammar-based compression

A fully linear-time approximation algorithm for grammar-based compression

... 1. Introduction In this paper we design a simple approximation algorithm for the grammar-based com- pression. Given a string for an input, an output is a smallest context-free grammar that generates only ...

15

A linear-time algorithm for maximum-cardinality matching on cocomparability graphs.

A linear-time algorithm for maximum-cardinality matching on cocomparability graphs.

... Preliminaries. We use standard notation from graph theory. In particular, all paths we consider are simple paths. A matching in a graph is a set of pairwise disjoint edges. Let G = (V, E) be an undirected graph, ...

17

A linear time algorithm to compute square of interval graphs and their colouring

A linear time algorithm to compute square of interval graphs and their colouring

... such algorithm for L (1, 1)-labelling of interval ...a simple linear time algorithm to compute square of graphs is also the motivation of our ...

11

A Linear-Time Algorithm for the Terminal Path Cover Problem in Block Graphs

A Linear-Time Algorithm for the Terminal Path Cover Problem in Block Graphs

... a linear-time algorithm for the path cover problem on block graphs ...another linear-time algorithm to solve the path cover problem on block graphs ...Chang’s ...

7

A Linear Time Algorithm for Quantum 2-SAT

A Linear Time Algorithm for Quantum 2-SAT

... of transfer operators according to the implication graph of Π 0 deterministically results in assignments to a subset of other qubits in the instance. In particular, what we are interested in is finding conflict-free CRs, ...

21

A SIMPLE AND FAST CONTOUR PLOTTING ALGORITHM FOR LINEAR 2D AND 3D ELEMENTS

A SIMPLE AND FAST CONTOUR PLOTTING ALGORITHM FOR LINEAR 2D AND 3D ELEMENTS

... use linear interpolation over triangular and tetrahedral ...fast algorithm for plotting linear contours over three-node triangular and four-node tetrahedral ...

7

Evaluating the Time Efficiency of the Modified Linear Search Algorithm

Evaluating the Time Efficiency of the Modified Linear Search Algorithm

... search algorithm that would be both independent of sorting and efficient brought about the development of the ‘bilinear search’ ...search’ algorithm is an improved/modified form of the linear search ...

7

A log linear time algorithm for constrained changepoint detection

A log linear time algorithm for constrained changepoint detection

... in time series and genomic ...new algorithm which can solve problems with arbitrary affine constraints on adjacent segment means, and which has empirical time complexity that is log-linear in ...

22

An average linear time algorithm for web data mining

An average linear time algorithm for web data mining

... ∆ T max 3.7 4.9 7.2 14.2 ∞ E(#O n ) 155 315 2555 327675 ∞ 4 Concluding Remarks Several authors have been studying the problem of mining web usage patterns from log data. Patterns inferred from past user navigation ...

23

A globally convergent QP free algorithm for nonlinear semidefinite programming

A globally convergent QP free algorithm for nonlinear semidefinite programming

... a QP-free algorithm for nonlinear semidefinite ...of linear equations with the same coefficient matrix; l 1 penalty function is used as merit function for line search, the step size is determined by ...

21

Simple Linear Regression

Simple Linear Regression

... For every 1% increase in the amount of drug in the bloodstream, the mean reaction time is estimated to increase by 0.7 seconds over the sampled range of drug amounts from 1% to 5%.[r] ...

7

Simple Linear Regression

Simple Linear Regression

... ing on. In the context of a simple linear regression model, outliers are often defined as points with an unusually large residual. As such, a common rule-of-thumb is to class any point with a studen- tised ...

48

Show all 10000 documents...

Related subjects