3616 search results - page 272 / 724 » Conditional Memory Ordering |
123
click to vote
AIPS
2006
15 years 6 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
115
click to vote
WSC
1997
15 years 6 months ago
1997
In this paper, the case of a cardboard box marketing firm is studied and a (R,s,Q,c) inventory replenishment policy is proposed and evaluated by means of discrete event simulation...
143
Voted
JMLR
2006
15 years 4 months ago
2006
In order to perform object recognition it is necessary to learn representations of the underlying components of images. Such components correspond to objects, object-parts, or fea...
124
Voted
MOR
2006
15 years 4 months ago
2006
: We study general state-space Markov chains that depend on a parameter, say, . Sufficient conditions are established for the stationary performance of such a Markov chain to be di...
157
Voted
JSCIC
2007
15 years 4 months ago
2007
Abstract. We analyze the so-called the minimal dissipation local discontinuous Galerkin method for convection-diffusion or diffusion problems. The distinctive feature of this met...