• No results found

efficient dynamic programming algorithm

Fast and Unbiased Estimation of Volume Under Ordered Three-Class ROC Surface (VUS) With Continuous or Discrete Measurements

Fast and Unbiased Estimation of Volume Under Ordered Three-Class ROC Surface (VUS) With Continuous or Discrete Measurements

... and efficient algorithm of linearithmic order, based on dynamic programming, for unbiased estimation of the mean and variance of VUS with unidimensional samples drawn from continuous or ...

18

An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm

An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm

... DP algorithm to search for the optimal solutions, and the time complexity was in pseudo- polynomial ...DP algorithm, even reaching exponential ...DP algorithm that can be executed in polynomial time ...

15

NODES PRIORITIZATION TRAVELLING SALESMAN PROBLEM

NODES PRIORITIZATION TRAVELLING SALESMAN PROBLEM

... Optimisation algorithm will be combined with a dynamic programming in obtaining an optimal distribution and return routes based on the critical edge ...different efficient algorithm for ...

10

Neuro dynamic programming for the efficient management of reservoir networks

Neuro dynamic programming for the efficient management of reservoir networks

... identically null function H 0 < 0 > ( ⋅ ) as target. Step 2) Main loop. For each algorithm iteration j compute backwards in time, for t from T-1 down to 0, T functions H ˆ t < j > ( ⋅ ) using equation ...

8

Bayesian optimization with a finite budget: An approximate dynamic programming approach

Bayesian optimization with a finite budget: An approximate dynamic programming approach

... the efficient global optimization (EGO) algorithm [10], minimizing a linear combination µ − ασ of the posterior mean µ and standard deviation σ in GP upper confidence bound (GP-UCB) [18], or maximizing a ...

9

A Dynamic Programming Algorithm for Computing N gram Posteriors from Lattices

A Dynamic Programming Algorithm for Computing N gram Posteriors from Lattices

... less efficient for n-grams of higher ...lattices. Algorithm 1 was described in (de Gispert et ...general algorithm for computing n-gram posteriors from a hypergraph in a single inside pass (DeNero et ...

10

Locus-aware decomposition of gene trees with respect to polytomous species trees

Locus-aware decomposition of gene trees with respect to polytomous species trees

... time efficient solutions to the proposed problems: an O(n 2 ) dynamic programming algorithm for LTI and a near linear time heuristic for CLTI designed to solve large ...

18

TAG, Dynamic Programming, and the Perceptron for Efficient, Feature Rich Parsing

TAG, Dynamic Programming, and the Perceptron for Efficient, Feature Rich Parsing

... perceptron algorithm, in conjunction with dynamic programming methods, to recover full constituent-based parse ...that efficient training is feasi- ble, using a Tree Adjoining Grammar (TAG) ...

8

Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation

Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation

... search algorithm for the IBM-2 translation model based on the A ∗ concept and multiple ...this algorithm is demonstrated in Wang and Waibel ...an efficient search algorithm by restricting the ...

37

Exploiting Domain Structure in Multiagent Decision-Theoretic Planning and Reasoning

Exploiting Domain Structure in Multiagent Decision-Theoretic Planning and Reasoning

... bottleneck dynamic programming step of several approximate algorithms, also known as the backup ...an efficient and scalable optimal algorithm for the decentralized backup ...

208

The Resource constrained shortest path problem implemented in a lazy functional language

The Resource constrained shortest path problem implemented in a lazy functional language

... The second array paths_ar is defined locally within the function sp_graph. This array will contain either a real list of paths from a node to the final node of the network, or the default list, if the node is unreachable ...

17

ASLBACC –A Study on Load Balancing Algorithms in Cloud Computing

ASLBACC –A Study on Load Balancing Algorithms in Cloud Computing

... throttle algorithm. This improved throttle algorithm works well even though underlying capacity of each VM is different because the hardware configuration of VMs is ...throttle algorithm is taking ...

5

Dynamic programming for parsing and estimation of stochastic unification based grammars

Dynamic programming for parsing and estimation of stochastic unification based grammars

... Obviously, an empirical evaluation of the algo- rithms described here would be extremely useful. The algorithms described here are exact, but be- cause we are working with unification grammars and apparently arbitrary ...

8

An algorithm to parse segment packing in predicted protein contact maps

An algorithm to parse segment packing in predicted protein contact maps

... the algorithm still behaved well, classifying most of the important interactions correctly in both a small and a large test ...the algorithm apportioning parts of a single large secondary structure ele- ...

12

Power Efficient Location Based Services on Smart Phones

Power Efficient Location Based Services on Smart Phones

... proposed dynamic tracking techniques, an indoor sensor network setting that take into account a positioning accuracy and delay, target speed and speeding up to detect if the target is moving or ...

5

Advanced Dynamic Programming in Semiring and Hypergraph Frameworks

Advanced Dynamic Programming in Semiring and Hypergraph Frameworks

... sophisticated algorithm that can be proved to work for all closed semir- ...single-source algorithm subsumes many classical algorithms like Dijkstra, Bellman-Ford (Bellman, 1958), and Viterbi as specific ...

18

Service Networks Topological Design

Service Networks Topological Design

... and algorithm minimiz- ing cost of processing and delivery are ...An algorithm solving combinatorial problem of optimal design based on binary partitioning, a parametric search and dynamic ...

5

An Efficient Dynamic Channel Allocation Algorithm for Wi MAX Networks

An Efficient Dynamic Channel Allocation Algorithm for Wi MAX Networks

... an efficient algorithm for channel assignment problem in cellular radio ...a dynamic channel allocation (DCA) technique based on an energy function whose minimization gives the optimal ...

6

Enhanced Efficient Dynamic Round Robin CPU Scheduling Algorithm

Enhanced Efficient Dynamic Round Robin CPU Scheduling Algorithm

... Abstract— Handle Scheduling is one of the central ideas of working framework. Round robin prepare booking calculation is ideal process planning calculation in time sharing frameworks. The productivity of the processor ...

8

Performance evaluation of scheduling policies for the DRCMPSP

Performance evaluation of scheduling policies for the DRCMPSP

... Since the GA and the RBA are reactive baseline scheduling algorithms, they generate decisions without considering the new project arrivals. Thus we may accept that the result of a reactive baseline scheduling ...

15

Show all 10000 documents...

Related subjects