Sciweavers

16666 search results - page 2612 / 3334
» Descriptive and Computational Complexity
Sort
View
JAIR
2000
152views more  JAIR 2000»
15 years 7 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
JCB
2000
87views more  JCB 2000»
15 years 7 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
PRESENCE
2000
94views more  PRESENCE 2000»
15 years 7 months ago
Virtual Environments with Four or More Spatial Dimensions
We describe methods for displaying complex, texturemapped environments with four or more spatial dimensions that allow for real-time interaction. At any one moment in time, a thre...
Michael D'Zmura, Philippe Colantoni, Gregory Seyra...
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 7 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
15 years 7 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon
« Prev « First page 2612 / 3334 Last » Next »