Sciweavers

808 search results - page 159 / 162
» What Is Answer Set Programming
Sort
View
DBPL
1999
Springer
102views Database» more  DBPL 1999»
14 years 1 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
STACS
1999
Springer
14 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICDCS
1990
IEEE
14 years 25 days ago
A Constructive Approach to the Design of Distributed Systems
The underlying model of distributed systems is that of loosely coupled components r running in parallel and communicating by message passing. Description, construction and evoluti...
Jeff Kramer, Jeff Magee, Anthony Finkelstein
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
14 years 23 days ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 21 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...