Sciweavers

1882 search results - page 234 / 377
» Transformational Programming and Forests
Sort
View
210
Voted
ECBS
2006
IEEE
203views Hardware» more  ECBS 2006»
15 years 9 months ago
The Feature-Architecture Mapping (FArM) Method for Feature-Oriented Development of Software Product Lines
Software product lines (PLs) are large, complex systems, demanding high maintainability and enhanced flexibility. Nonetheless, in the state of the art PL methods, features are sca...
Periklis Sochos, Matthias Riebisch, Ilka Philippow
EURONGI
2006
Springer
15 years 9 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer
171
Voted
ATAL
2008
Springer
15 years 8 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
CC
2008
Springer
15 years 8 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
IANDC
2007
84views more  IANDC 2007»
15 years 6 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...