Sciweavers

595 search results - page 78 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
112
Voted
GTTSE
2007
Springer
15 years 9 months ago
Automated Merging of Feature Models Using Graph Transformations
Abstract. Feature Models (FMs) are a key artifact for variability and commonality management in Software Product Lines (SPLs). In this context, the merging of FMs is being recogniz...
Sergio Segura, David Benavides, Antonio Ruiz Cort&...
CASES
2003
ACM
15 years 7 months ago
Efficient spill code for SDRAM
Processors such as StrongARM and memory such as SDRAM enable efficient execution of multiple loads and stores in a single instruction. This is particularly useful in connection wi...
V. Krishna Nandivada, Jens Palsberg
154
Voted
SPAA
2012
ACM
13 years 5 months ago
Memory-mapping support for reducer hyperobjects
hyperobjects (reducers) provide a linguistic abstraction for dynamic multithreading that allows different branches of a parallel program to maintain coordinated local views of the...
I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leis...
SAC
2006
ACM
15 years 3 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
132
Voted
IVC
2006
227views more  IVC 2006»
15 years 3 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu