Sciweavers

1047 search results - page 186 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ENTCS
2006
140views more  ENTCS 2006»
13 years 7 months ago
A Library for Self-Adjusting Computation
We present a Standard ML library for writing programs that automatically adjust to changes to their data. The library combines modifiable references and memoization to achieve eff...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Rob...
DAC
2003
ACM
14 years 8 months ago
An IDF-based trace transformation method for communication refinement
In the Artemis project [13], design space exploration of embedded systems is provided by modeling application behavior and architectural performance constraints separately. Mappin...
Andy D. Pimentel, Cagkan Erbas
IPPS
1993
IEEE
13 years 12 months ago
Parallel Algorithms for Hypercube Allocation
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
Yeimkuan Chang, Laxmi N. Bhuyan
MODELLIERUNG
2004
13 years 9 months ago
CASE Support and Model-Based Development
ion from the implementation they use. Some tools rather consequently use this abstract model; others at least partly keep the implementational view, modeling components, e.g., by o...
Bernhard Schätz, Jan Romberg, Oscar Slotosch,...
TMA
2010
Springer
137views Management» more  TMA 2010»
13 years 5 months ago
K-Dimensional Trees for Continuous Traffic Classification
Abstract. The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works ha...
Valentín Carela-Español, Pere Barlet...