Sciweavers

3256 search results - page 397 / 652
» Mixin-Based Programming in C
Sort
View
C5
2004
IEEE
15 years 4 months ago
Scratch: A Sneak Preview
information technologies as "the ability to reformulate knowledge, to express oneself creatively and appropriately, and to produce and generate information (rather than simply...
John Maloney, Leo Burd, Yasmin B. Kafai, Natalie R...
CASES
2001
ACM
15 years 4 months ago
Storage allocation for embedded processors
In an embedded system, it is common to have several memory areas with different properties, such as access time and size. An access to a specific memory area is usually restricted...
Jan Sjödin, Carl von Platen
170
Voted
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 4 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
92
Voted
ASPLOS
2008
ACM
15 years 2 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
118
Voted
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 1 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani