Sciweavers

1550 search results - page 211 / 310
» Benchmarking for Graph Transformation
Sort
View
BIRTHDAY
2005
Springer
15 years 6 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
ASPLOS
1994
ACM
15 years 4 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
MMB
2012
Springer
259views Communications» more  MMB 2012»
13 years 8 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
79
Voted
ICPR
2006
IEEE
16 years 1 months ago
Segmentation and Probabilistic Registration of Articulated Body Models
There are different approaches to pose estimation and registration of different body parts using voxel data. We propose a general bottom-up approach in order to segment the voxels...
Aravind Sundaresan, Rama Chellappa
MODELS
2009
Springer
15 years 7 months ago
An Incremental Algorithm for High-Performance Runtime Model Consistency
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...