Sciweavers

5169 search results - page 561 / 1034
» Locality approximation using time
Sort
View
ICLP
2007
Springer
16 years 1 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
DOLAP
2006
ACM
16 years 1 months ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
16 years 6 days ago
Design of Asymptotically Stable Walking for a 5-Link Planar Biped Walker via Optimization
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...
E. R. Westervelt, J. W. Grizzle
SIGMETRICS
1993
ACM
118views Hardware» more  SIGMETRICS 1993»
15 years 11 months ago
An Analytic Performance Model of Disk Arrays
As disk arrays become widely used, tools for understanding and analyzing their performance become increasingly important. In particular, performance models can be invaluable in bo...
Edward K. Lee, Randy H. Katz
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....