Sciweavers

1499 search results - page 200 / 300
» Chopping Concurrent Programs
Sort
View
146
Voted
INFOCOM
2006
IEEE
16 years 2 days ago
Holographic and 3D Teleconferencing and Visualization: Implications for Terabit Networked Applications
— We discuss the evolution of teleconferencing and networked visualization applications to support 3-dimensional display technologies. The implications of a continuation of Moore...
Ladan Gharai, Colin Perkins
174
Voted
TPHOL
2005
IEEE
15 years 11 months ago
Axiomatic Constructor Classes in Isabelle/HOLCF
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with t...
Brian Huffman, John Matthews, Peter White
EUROPAR
2005
Springer
15 years 11 months ago
The Combined Perceptron Branch Predictor
— Previous works have shown that neural branch prediction techniques achieve far lower misprediction rate than traditional approaches. We propose a neural predictor based on two ...
Matteo Monchiero, Gianluca Palermo
ICCS
2005
Springer
15 years 11 months ago
Introducing Design Patterns, Graphical User Interfaces and Threads Within the Context of a High Performance Computing Applicatio
The cross fertilization of methods and techniques between different subject areas in the undergraduate curriculum is a challenge, especially at the more advanced levels. This paper...
James Roper, Alistair P. Rendell
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 11 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko