Sciweavers

11212 search results - page 19 / 2243
» Semi-persistent Data Structures
Sort
View
CAISE
2008
Springer
13 years 9 months ago
A New Paradigm for the Enactment and Dynamic Adaptation of Data-Driven Process Structures
Abstract. Industry is increasingly demanding IT support for large engineering processes, i.e., process structures consisting of hundreds up to thousands of processes. Developing a ...
Dominic Müller, Manfred Reichert, Joachim Her...
DEXAW
2004
IEEE
177views Database» more  DEXAW 2004»
13 years 11 months ago
An Example of the ESTEST Approach to Combining Unstructured Text and Structured Data
In this paper, we demonstrate the use of the ESTEST system, which combines the data integration approach with techniques from Information Extraction in order to allow information ...
Dean Williams, Alexandra Poulovassilis
IPPS
1997
IEEE
13 years 11 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
GRAPHICSINTERFACE
2001
13 years 9 months ago
Accelerated Splatting using a 3D Adjacency Data Structure
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
Jeff Orchard, Torsten Möller
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 8 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn