نتایج جستجو برای: space planning 2
تعداد نتایج: 3079149 فیلتر نتایج به سال:
abstract:assume that y is a banach space such that r(y ) ? 2, where r(.) is garc?a-falset’s coefficient. and x is a banach space which can be continuously embedded in y . we prove that x can be renormed to satisfy the weak fixed point property (w-fpp). on the other hand, assume that k is a scattered compact topological space such that k(!) = ? ; and c(k) is the space of all real continuous ...
the space now known as complete erdos space ec was introduced by paul erdos in 1940 as the closed subspace of the hilbert space ?2 consisting of all vectors such that every coordinate is in the convergent sequence {0} ? { 1 n : n ? n}. in a solution to a problem posed by lex g. oversteegen we present simple and useful topological characterizations of ec. as an application we determine the ...
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning systems explore either paths in the state space (state-space planning) or partial plans (plan-space planning). In this paper we show how the ideas from plan-space (partial order) planning can be integrated into state-...
this study compared the different effects of form-focused guided planning vs. meaning-focused guided planning on iranian pre-intermediate students’ task performance. the study lasted for three weeks and concentrated on eight english structures. forty five pre-intermediate iranian students were randomly assigned to three groups of guided planning focus-on-form group (gpfg), guided planning focus...
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
Derivation replay was first proposed by Carbonell as a method of transferring guidance from a previous problemsolving episode to a new one. Subsequent implementations have used state-space planning as the underlying methodology. This paper is motivated by the acknowledged superiority of partial-order (PO) planners in plan generation, and is an attempt to bring derivation replay into the realm o...
Derivation replay was first proposed by Carbonell as a method of transferring guidance from a previous problemsolving episode to a new one. Subsequent implementations have used state-space planning as the underlying methodology. This paper is motivated by the acknowledged superiority of partial-order (PO) planners in plan generation, and is an attempt to bring derivation replay into the realm o...
The common wisdom that goal orderings can be used to improve planning performance is nearly as old as planning itself. During the last decades of research several approaches emerged that computed goal orderings for diierent planning paradigms, mostly in the area of state-space planning. For partial-order, plan-space planners goal orderings have not been investigated in much detail. Mechanisms d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید