Results 1  10
of
404
Generalized bestfirst search strategies and the optimality of A*
 JOURNAL OF THE ACM
, 1985
"... This paper reports several properties of heuristic bestfirst search strategies whose scoring functions f depend on all the information available from each candidate path, not merely on the current cost g and the estimated completion cost h. It is shown that several known properties of A * retain t ..."
Abstract

Cited by 234 (15 self)
 Add to MetaCart
their form (with the minmax offplaying the role of the optimal cost), which helps establish general tests of admissibility and general conditions for node expansion for these strategies. On the basis of this framework the computational optimality of A*, in the sense of never expanding a node that can
A survey of methods and strategies in character segmentation
 IEEE TRANSACTION ON PAMI
, 1996
"... Character segmentation has long been a critical area of the OCR process. The higher recognition rates for isolated characters vs. those obtained for words and connected character strings well illustrate this fact. A good part of recent progress in reading unconstrained printed and written text may b ..."
Abstract

Cited by 212 (1 self)
 Add to MetaCart
either explicitly, by classification of prespecified windows, or implicitly by classification of subsets of spatial features collected from the image as a whole. The third strategy is a hybrid of the first two, employing dissection together with recombination rules to define potential segments, but using
On Families of Weakly Admissible Filtered ϕModules and the Adjoint Quotient of GLd
 DOCUMENTA MATH.
, 2011
"... We study the relation of the notion of weak admissibility in families of filtered ϕmodules, as considered in [He], with the adjoint quotient. We show that the weakly admissible subset is an open subvariety in the fibers over the adjoint quotient. Further we determine the image of the weakly admissi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We study the relation of the notion of weak admissibility in families of filtered ϕmodules, as considered in [He], with the adjoint quotient. We show that the weakly admissible subset is an open subvariety in the fibers over the adjoint quotient. Further we determine the image of the weakly
A Lefschetz fixed point theorem for admissible maps in Frechet spaces
, 2007
"... The Lefschetz xed point theorem is discussed for the admissible maps of Gorniewicz de ned on admissible subsets of a Hausdorff topological space. Also using the projective limit approach we present new Lefschetz xed point theorems for the admissible maps of Gorniewicz de ned on PRLF's or CPRLF ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Lefschetz xed point theorem is discussed for the admissible maps of Gorniewicz de ned on admissible subsets of a Hausdorff topological space. Also using the projective limit approach we present new Lefschetz xed point theorems for the admissible maps of Gorniewicz de ned on PRLF
Admissible Graph Rewriting and Narrowing
 IN PROCEEDINGS OF THE JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING
, 1998
"... We address the problem of graph rewriting and narrowing as the underlying operational semantics of rulebased programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first char ..."
Abstract

Cited by 35 (10 self)
 Add to MetaCart
characterize a subset of graphs, called admissible graphs. A graph is admissible if none of its defined operations belongs to a cycle. We then prove the confluence, as well as the confluence modulo bisimilarity (unraveling), of the admissible graph rewriting relation. Afterwards, we define a sequential graph
Relational Properties of Domains
 Information and Computation
, 1996
"... New tools are presented for reasoning about properties of recursively defined domains. We work within a general, categorytheoretic framework for various notions of `relation' on domains and for actions of domain constructors on relations. Freyd's analysis of recursive types in terms of a ..."
Abstract

Cited by 115 (6 self)
 Add to MetaCart
semantics for functional programming languages with userdeclared datatypes. We show how the initiality/finality property of invariant relations can be specialized to yield an induction principle for admissible subsets of recursively defined domains, generalizing the principle of structural induction
Finding Optimal Solutions to Rubik's Cube Using Pattern Databases
, 1997
"... We have found the first optimal solutions to random instances of Rubik's Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterativedeepeningA* (IDA*), with a lowerbound heuristic function based on large memorybased lookup tables, or "pattern databas ..."
Abstract

Cited by 158 (8 self)
 Add to MetaCart
;pattern databases" (Culberson and Schaeffer 1996). These tables store the exact numberofmoves required to solve various subgoals of the problem, in this case subsets of the individual movable cubies. We characterize the effectiveness of an admissible heuristic function by its expected value, and hypothesize
Admissibility and common belief
 Games and Economic Behavior
"... Abstract The concept of 'fully permissible sets' is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Abstract The concept of 'fully permissible sets' is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates
Stability of Random AdmissibleSet Scheduling in Spatial Wireless Systems∗
, 2010
"... We examine the stability of wireless networks whose users are distributed over a compact space. Users arrive at spatially uniform locations with intensity λ and each user has a random number of packets to transmit with mean β. In each time slot, an admissible subset of users is selected uniformly at ..."
Abstract
 Add to MetaCart
We examine the stability of wireless networks whose users are distributed over a compact space. Users arrive at spatially uniform locations with intensity λ and each user has a random number of packets to transmit with mean β. In each time slot, an admissible subset of users is selected uniformly
Asymptotically Admissible Texture Synthesis
 In International Workshop on Statistical and Computational Theories of Vision
, 2001
"... Recently there is a resurgent interest in example based texture analysis and synthesis in both computer vision and computer graphics. While study in computer vision is concerned with learning accurate texture models, research in graphics is aimed at effective algorithms for texture synthesis wit ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
texture sampling algorithm using admissibility, effectiveness, and sampling speed. Second, we compare and analyze texture sampling algorithms based on admissibility and effectiveness. In particular, we propose different design criteria for texture analysis algorithms in computer vision and texture
Results 1  10
of
404