Sciweavers

9736 search results - page 15 / 1948
» How Fast Can We Compute Products
Sort
View
SAC
2009
ACM
15 years 9 months ago
Automatic product derivation of multi-agent systems product lines
Multi-agent Systems (MASs) development and Software Product Lines (SPLs) are two consolidated software engineering techniques. Recent research work explores the integration betwee...
Elder Cirilo, Ingrid Nunes, Uirá Kulesza, C...
SPLC
2008
15 years 5 months ago
Calculating and Modeling Common Parts of Software Product Lines
This paper builds on product line CCS (PL-CCS), an algebraic approach to modeling the behavior of software product lines. The semantics of PL-CCS specifications is given in terms ...
Alexander Gruler, Martin Leucker, Kathrin D. Schei...
GI
2000
Springer
15 years 7 months ago
Taming the Tiger: How to Cope with Real Database Products in Transactional Federations for Internet Applications
Data consistency in transactional federations is a key requirement of advanced E-service applications on the Internet, such as electronic auctions or real-estate purchase. Federat...
Ralf Schenkel, Gerhard Weikum
PPOPP
2012
ACM
13 years 12 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CIKM
2000
Springer
15 years 8 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu