scholarly journals Completeness-Preserving Dominance Techniques for Satisficing Planning

2018 ◽  
Author(s):  
Álvaro Torralba
Keyword(s):  
Action Selection ◽  
New Method ◽  
Hill Climbing ◽  
Optimal Planning ◽  
Dominance Relations ◽  
Definition Of ◽  
Goal Distance ◽  
Pruning Methods

Dominance pruning methods have recently been introduced for optimal planning. They compare states based on their goal distance to prune those that can be proven to be worse than others. In this paper, we introduce dominance techniques for satisficing planning. We extend the definition of dominance, showing that being closer to the goal is not a prerequisite for dominance in the satisficing setting. We develop a new method to automatically find dominance relations in which a state dominates another if it has achieved more serializable sub-goals. We take advantage of dominance relations in different ways; while in optimal planning their usage focused on dominance pruning and action selection, we also use it to guide enforced hill-climbing search, resulting in a complete algorithm.

scholarly journals From Qualitative to Quantitative Dominance Pruning for Optimal Planning

2017 ◽  
Author(s):  
Álvaro Torralba
Keyword(s):  
Action Selection ◽  
Search Space ◽  
The State ◽  
Optimal Planning ◽  
Optimal Plan ◽  
Dominance Relations ◽  
The Difference ◽  
G Value ◽  
Goal Distance ◽  
Better Than

Dominance relations compare states to determine whether one is at least as good as another in terms of their goal distance. We generalize these qualitative yes/no relations to functions that measure by how much a state is better than another. This allows us to distinguish cases where the state is strictly closer to the goal. Moreover, we may obtain a bound on the difference in goal distance between two states even if there is no qualitative dominance.We analyze the multiple advantages that quantitative dominance has, like discovering coarser dominance relations, or trading dominance by g-value. Moreover, quantitative dominance can also be used to prove that an action starts an optimal plan from a given state. We introduce a novel action selection pruning that uses this to prune any other successor. Results show that quantitative dominance pruning greatly reduces the search space, significantly increasing the planners' performance.

scholarly journals Establishing a Comprehensive English Teaching Pattern Combining the Communicative Teaching Method and the Grammar-Translation Method

2011 ◽  
Vol 4 (1) ◽  
pp. 76 ◽  
Author(s):  
Na Kong
Keyword(s):  
Teaching Methods ◽  
Teaching Method ◽  
New Method ◽  
Translation Method ◽  
English Teaching ◽  
Advantages And Disadvantages ◽  
Grammar Translation Method ◽  
Teaching Pattern ◽  
Definition Of ◽  
Communicative Teaching

Based on the current contradiction between the grammar-translation method and the communicative teaching method in English teaching, this paper, starting with clarifying the task of comprehensive English as well as the definition of the two teaching methods, objectively analyzes their advantages and disadvantages and proposes establishing a new method by fusing them with an elaboration on the reasonability of combining them in the practical teaching of comprehensive English with their complementary advantages.

Estimation of Failure Probability and its Applications in Reliability Data Analysis

2010 ◽  
Vol 118-120 ◽  
pp. 601-605
Author(s):  
Han Ming
Keyword(s):  
Parameter Estimation ◽  
Data Analysis ◽  
Bayesian Estimation ◽  
Failure Probability ◽  
Evaluation Method ◽  
Estimation Method ◽  
New Method ◽  
Reliability Parameter ◽  
Hierarchical Bayesian Estimation ◽  
Definition Of

Evaluation method of reliability parameter estimation needs to be improved effectively with the advance of science and technology. This paper develops a new method of parameter estimation, which is named E-Bayesian estimation method. In the case one hyper-parameter, the definition of E-Bayesian estimation of the failure probability is provided, moreover, the formulas of E-Bayesian estimation and hierarchical Bayesian estimation, and the property of E-Bayesian estimation of the failure probability are also provided. Finally, calculation on practical problems shows that the provided method is feasible and easy to perform.

Triumvirate and Principate

1973 ◽  
Vol 63 ◽  
pp. 50-67 ◽  
Author(s):  
Fergus Millar
Keyword(s):  
Contemporary Literature ◽  
Historical Change ◽  
New Method ◽  
The Common ◽  
The Republic ◽  
Definition Of ◽  
Res Publica

More than thirty years after its publication The Roman Revolution still stands unrivalled, not as the ‘definitive’ account of the emergence of a monarch from the ruins of the Republic but as something far more than that, the demonstration of a new method in the presentation of historical change. The aspect of this method, which has found most imitation, is of course prosopography; and it is indeed essential to it. But far more important is the use made of contemporary literature to mirror events, and to analyse and define the concepts and the terms in which the events were seen by those who lived through them.It is the common characteristic, perhaps even the definition, of great works of history that they invite imitation and offer a challenge, not just to apply their methods and standards to other areas, but to pursue their own conclusions further. The present paper is gratefully offered as an attempt to portray with a different emphasis some aspects of the establishment of Octavian as a monarch, first by demonstrating the extent to which the institutions of the res publica remained active in the Triumviral period, and secondly by redefining the change which culminated in 27 B.C., precisely by asking again in what terms it and the novus status which emerged from it were seen by contemporaries.

Optimization Analysis on Dynamic Reduction Algorithm

2018 ◽  
Vol 6 (5) ◽  
pp. 447-458
Author(s):  
Yizhou Chen ◽  
Jiayang Wang
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Reduction Process ◽  
New Method ◽  
Reduction Algorithm ◽  
Optimization Analysis ◽  
Sampling Process ◽  
Dynamic Methods ◽  
Definition Of

Abstract On the basis of rough set theory, the strengths of dynamic reduction are elaborated compared with traditional non-dynamic methods. A systematic concept of dynamic reduction from sampling process to the generation of the reduct set is presented. A new method of sampling is created to avoid the defects of being too subjective. And in order to deal with the over-sized time consuming problem in traditional dynamic reduction process, a quick algorithm is proposed within the constraint conditions. We have also proved that dynamic core possesses the essential characteristics of a reduction core on the basis of the formalized definition of the multi-layered dynamic core.

scholarly journals A Systematic, Automated Approach for River Segmentation Tested on the Magdalena River (Colombia) and the Baker River (Chile)

Water ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 2827
Author(s):  
Andrea Nardini ◽  
Santiago Yépez ◽  
Bruno Mazzorana ◽  
Héctor Ulloa ◽  
María Dolores Bejarano ◽  
...  
Keyword(s):  
Case Studies ◽  
Iterative Procedure ◽  
Traditional Approach ◽  
Point Of View ◽  
New Method ◽  
Segment Length ◽  
Valley Bottom ◽  
Systematic Procedure ◽  
Magdalena River ◽  
Definition Of

This paper proposes a systematic procedure to identify river reaches from a geomorphic point of view. Their identification traditionally relies on a subjective synthesis of multi-dimensional information (e.g., changes of slope, changes of width of valley bottom). We point out that some of the attributes adopted to describe geomorphic characters of a river (in particular sinuosity and confinement) depend on the length of reaches, while these latter are not yet identified; this is a source of ambiguity and introduces, at least conceptually, an unpleasant, implicit, iterative procedure. We introduce a new method which avoids this difficulty. Furthermore, it is simple, objective, and explicitly defined, and as such, it is automatable. The method requires to define and determine a set of intensive attributes, i.e., attributes that are independent of the segment length. The reaches are then identified by the intersection of the segmentations induced by such attributes. We applied the proposed procedure in two case studies, the Magdalena River (Colombia) and the Baker River (Chile), and investigated whether the adoption of the traditional approach for the definition of reaches would lead to a different result. We conclude that there would be no detectable differences. As such, the method can be considered an improvement in geomorphic river characterization.

New discrete reactive power factor definition of the two-terminal network

2017 ◽  
Vol 65 (3) ◽  
pp. 369-373
Author(s):  
M. Siwczyński ◽  
M. Jaraczewski
Keyword(s):  
Fourier Transform ◽  
Power Factor ◽  
Reactive Power ◽  
New Method ◽  
Unitary Operators ◽  
Calculation Results ◽  
The Fourier Transform ◽  
Definition Of ◽  
Operator Decomposition

Abstract This paper describes a new method of determining the reactive power factor. The reactive power factor herein is calculated on the basis of time samples and not] with the Fourier transform of signals, like it was done previously. The new reactive power factor calculation results from the receiver admittance-operator decomposition into the product of self-adjoint and unitary operators. This is an alternative decomposition to another one, namely into a sum of the Hermitian and skew-Hemiitian operators.

scholarly journals FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH

2007 ◽  
Vol 18 (06) ◽  
pp. 937-947 ◽  
Author(s):  
F. A. RODRIGUES ◽  
G. TRAVIESO ◽  
L. da F. COSTA
Keyword(s):  
New Method ◽  
Community Identification ◽  
Growth Method ◽  
Community Finding ◽  
Definition Of

A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most community finding algorithms.

Sign in / Sign up

Export Citation Format

Share Document