• No results found

time-sequential sampling problem

Sequential importance sampling for bipartite graphs with applications to likelihood-based inference

Sequential importance sampling for bipartite graphs with applications to likelihood-based inference

... graph-counting problem and approximating the null distri- bution of a test statistic, empirical evidence fails to show that SIS has any distinct advantages over MCMC in likelihood inference ...of time when ...

33

Global Sampling for Sequential Filtering over Discrete State Space

Global Sampling for Sequential Filtering over Discrete State Space

... State-space models have been around for quite a long time to model dynamic systems. State-space models are used in a variety of fields such as computer vision, financial data anal- ysis, mobile communication, ...

13

Efficient sequential sampling for global optimization in static and dynamic environments

Efficient sequential sampling for global optimization in static and dynamic environments

... The selected subset of functions from the complete BBOB set of functions in which the experiment described in this section was performed was chosen so that the EGO algorithm performed sufficiently well to capture any ...

134

Adaptive list sequential sampling method for population-based observational studies

Adaptive list sequential sampling method for population-based observational studies

... invite more individuals from groups related to a low will- ingness to participate [7]. However, this approach requires that the participation probability per person or group is known before the sampling procedure ...

9

Construction of Some Unbalanced Designs for the Partition Problem

Construction of Some Unbalanced Designs for the Partition Problem

... the sequential procedure with elimination is the best choice, with respect to robustness and the total sample ...If sequential sampling is not convenient, then the fine tuned three-stage procedure is ...

62

Finding the Most Interesting Patterns in a Database Quickly by Using Sequential Sampling

Finding the Most Interesting Patterns in a Database Quickly by Using Sequential Sampling

... a sampling algorithm that solves this problem by issuing a small number of database queries while guaranteeing precise bounds on the confidence and quality of ...Known sampling approaches have ...

30

Empirical Bayes Prediction for Variables Process Mean in Sequential Sampling Plan

Empirical Bayes Prediction for Variables Process Mean in Sequential Sampling Plan

... single sampling plan and sequential sampling plan by variables and provided the probability of acceptance the lot higher than the traditional ...in sequential sampling plan is given the ...

6

Sequential Pattern Mining Using Apriori Algorithm & Frequent Pattern Tree Algorithm

Sequential Pattern Mining Using Apriori Algorithm & Frequent Pattern Tree Algorithm

... years, sequential pattern mining has largely useful to several application domains, such as market-basket data analysis, medicine, Web log analysis, and telecommunications ...business, sequential patterns ...

5

The Problem of Time

The Problem of Time

... the time element is considered, it is scarcely accepted as a relevant element and basically dismissed as soon as possible from the cognitive elaboration (on a formalization level) despite its crucial importance ...

9

Supplementary information for: Macromolecular modeling and design in Rosetta: new methods and frameworks

Supplementary information for: Macromolecular modeling and design in Rosetta: new methods and frameworks

... Fast Protein Loop Sampling and Structure Prediction Using Distance-Guided. Sequential Chain-Growth Monte Carlo Method[r] ...

22

Cumulative Innovation, Sampling and the Hold Up Problem

Cumulative Innovation, Sampling and the Hold Up Problem

... Sampling benefits a firm by increasing the probability of having a high value innovation but it is costly. As it takes place prior to any kind of royalty negotiation it may lead to hold-up: the hold-up of the ...

33

On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem

On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem

... vex programs should be designed so that each member of this infinite class of feasibility problems can be solved via one of those convex programs. As a by-product, we de- rive the first nontrivial theoretical guarantee ...

8

Stiffness-based Approach for Preliminary Design of Framed Tube Structures

Stiffness-based Approach for Preliminary Design of Framed Tube Structures

... A parametric formulation for preliminary design of tubed-system tall buildings is presented in which some optimality criteria and practical constraints are considered. Here, a minimum compliance optimization formulation, ...

9

Analyzing time attributes in temporal event sequences

Analyzing time attributes in temporal event sequences

... the Sequential and Time Patterns overview using the Rheumatology ...(a) Sequential and Time Patterns overview where all events are encoded as point ...for time attributes, which allow ...

6

Interpolation based Off line Robust MPC for Uncertain Polytopic Discrete time Systems

Interpolation based Off line Robust MPC for Uncertain Polytopic Discrete time Systems

... computational time, various researchers have studied off-line robust MPC ...computational time is reduced by pre-computing off-line a sequence of state feedback gains corresponding to a sequence of ...

18

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

... Genetic Algorithm is relatively new optimization techniques which can be applied to various problems of different domain including those are NP-hard.TSP is one such combinatorial optimization and NP-hard problem. ...

8

A Survey on Feature Selection : in the Perspective of Evolutionary Approaches

A Survey on Feature Selection : in the Perspective of Evolutionary Approaches

... optimal feature subsets. The results show that heuristic search techniques achieved similar performance to the backtracking algorithm but used a much shorter time. In recent years, EC techniques as effective ...

8

Properties of realized variance for a pure jump process: calendar time sampling versus business time sampling

Properties of realized variance for a pure jump process: calendar time sampling versus business time sampling

... optimal sampling frequency under BTS (whether to evaluate the MSE at the optimal sampling frequency under BTS or CTS here does not have a material impact on the results since both lie closely together in ...

27

Adaptive and unequal probability survey designs for environmental management

Adaptive and unequal probability survey designs for environmental management

... of sampling if large gains in efficiency are to be ...the sequential allocation of additional units, compared with the ...cluster sampling (Brown 2003, Smith et ...

7

Hierarchical Knowledge Gradient for Sequential Sampling

Hierarchical Knowledge Gradient for Sequential Sampling

... requires sampling suboptimal arms no more than a logarithmic number of times, while achieving optimal terminal regret requires sampling every arm a linear number of ...

44

Show all 10000 documents...

Related subjects