Sciweavers

175 search results - page 4 / 35
» Partially Ordered Runs: A Case Study
Sort
View
DBPL
2001
Springer
167views Database» more  DBPL 2001»
13 years 10 months ago
A Temporal Query Language for OLAP: Implementation and a Case Study
Commercial OLAP systems usually treat OLAP dimensions as static entities. In practice, dimension updates are often necessary in order to adapt the multidimensional database to chan...
Alejandro A. Vaisman, Alberto O. Mendelzon
AI
2007
Springer
13 years 6 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
AFP
2008
Springer
249views Formal Methods» more  AFP 2008»
14 years 5 days ago
An iTask Case Study: A Conference Management System
Workflow systems are automated systems in which tasks are coordinated by assigning them to either humans or computers. Contemporary workflow systems are static and not very flex...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
LFCS
1992
Springer
13 years 10 months ago
Machine Learning of Higher Order Programs
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
Ganesh Baliga, John Case, Sanjay Jain, Mandayam Su...
IPPS
2006
IEEE
13 years 12 months ago
On-chip and on-line self-reconfigurable adaptable platform: the non-uniform cellular automata case
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...
Andres Upegui, Eduardo Sanchez