Sciweavers

81 search results - page 4 / 17
» Smaller explicit superconcentrators
Sort
View
POPL
2006
ACM
14 years 7 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
ICCD
2007
IEEE
132views Hardware» more  ICCD 2007»
14 years 4 months ago
A position-insensitive finished store buffer
This paper presents the Finished Store Buffer (or FSB), an alternative and position-insensitive approach for building a scalable store buffer for an out-of-order processor. Exploi...
Erika Gunadi, Mikko H. Lipasti
CIDM
2009
IEEE
14 years 2 months ago
Large-scale attribute selection using wrappers
Abstract— Scheme-specific attribute selection with the wrapper and variants of forward selection is a popular attribute selection technique for classification that yields good ...
Martin Gutlein, Eibe Frank, Mark Hall, Andreas Kar...
INFOCOM
2008
IEEE
14 years 1 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
CONCUR
2007
Springer
14 years 1 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol