Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
97
EXISTENCE OF TWO NON-TRIVIAL SOLUTIONS FOR A CLASS OF QUASILINEAR ELLIPTIC VARIATIONAL SYSTEMS ON STRIP-LIKE DOMAINS
, 2004
"... Abstract In this paper we study the multiplicity of solutions of the quasilinear elliptic system −∆pu = λFu(x, u, v) in Ω, −∆qv = λFv(x, u, v) in Ω, u = v = 0 on ∂Ω, ⎪ ⎭ (Sλ) where Ω is a strip-like domain and λ> 0 is a parameter. Under some growth conditions on F, we guarantee the existence of a ..."
Abstract
- Add to MetaCart
Abstract In this paper we study the multiplicity of solutions of the quasilinear elliptic system −∆pu = λFu(x, u, v) in Ω, −∆qv = λFv(x, u, v) in Ω, u = v = 0 on ∂Ω, ⎪ ⎭ (Sλ) where Ω is a strip-like domain and λ> 0 is a parameter. Under some growth conditions on F, we guarantee the existence
Bernoulli free-boundary problems in strip-like domains and a property of permanent waves in water of finite depth
, 2007
"... ..."
Fast Planning Through Planning Graph Analysis
- ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partial-order plan, or states that no valid pla ..."
Abstract
-
Cited by 1171 (3 self)
- Add to MetaCart
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partial-order plan, or states that no valid
F EEE EA DE A!BEE B "ED!BEDEE EE !E#BEE #EEED CED$BEECE%E&EE
, 2007
"... Bernoulli free-boundary problems in strip-like domains and a property of permanent waves on water of finite depth ABCDEFB ..."
Abstract
- Add to MetaCart
Bernoulli free-boundary problems in strip-like domains and a property of permanent waves on water of finite depth ABCDEFB
Expressivity of STRIPS-like and HTN-like Planning
"... Abstract. It is widely believed, that the expressivity of STRIPS and STRIPS-like planning based on actions is generally lower than the ex-pressivity of Hierarchical Task Network (HTN) and HTN-like planning, based on hierarchical decomposition. This would mean that a HTN-like planner can generally so ..."
Abstract
- Add to MetaCart
solve more domains than a STRIPS-like planner with the same extensions. In this paper, we show that both approaches, as they are practically used, are identically expressive and can solve all domains solvable by a Turing machine with finite tape (i.e. solvable by a common computer). 1
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems
- Journal of Artificial Intelligence Research
, 2003
"... We describe a system for specifying the e#ects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify the e#ects of actions using domain rules, which are state constraints that can entail new action e#ects from old ones. De ..."
Abstract
-
Cited by 21 (6 self)
- Add to MetaCart
. Declaratively, an action domain in our language corresponds to a nonmonotonic causal theory in the situation calculus. Procedurally, such an action domain is compiled into a set of logical theories, one for each action in the domain, from which fully instantiated successor state-like axioms and STRIPS-like
From Causal Theories to Successor State Axioms and STRIPS-Like Systems
"... We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify the effects of actions using domain rules, which are state constraints that can entail new action effects from old one ..."
Abstract
- Add to MetaCart
axioms and STRIPS-like systems are then generated. We expect the system to be a useful tool for knowledge engineers writing action specifications for classical AI planning systems, GOLOG systems, and other systems where formal specifications of actions are needed. Introduction We describe a system
Planning as heuristic search,
- 5 – 33, ISSN
, 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract
-
Cited by 421 (33 self)
- Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting
Multi-Agent Planning
, 2003
"... work contained in this document has been submitted in support of an application for a degree or qualification of this or any other university or other institution of learning. All verbatim extracts have been distinguished by quotation marks, and all sources of information have been specifically ackn ..."
Abstract
- Add to MetaCart
acknowledged. Signed: Date: 2003 We describe a distributed planning system for STRIPS-like domains. We have implemented the Graphplan algorithm, which has been proven to be correct and complete as well as, at the time, the fastest planning algorithm for solving classical problems in STRIPS-like domains. We
The Asymptotic Behavior of Conformal Modules of Quadrilaterals with Applications to the Estimation of Resistance Values
, 1999
"... We consider the conformal mapping of “strip-like” domains and derive a number of asymptotic results for computing the conformal modules of an associated class of quadrilaterals. These results are then used for the following two purposes: (a) to estimate the error of certain engineering formulas fo ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
We consider the conformal mapping of “strip-like” domains and derive a number of asymptotic results for computing the conformal modules of an associated class of quadrilaterals. These results are then used for the following two purposes: (a) to estimate the error of certain engineering formulas
Results 1 - 10
of
97
