Sciweavers

727 search results - page 137 / 146
» A Calculus of Bounded Capacities
Sort
View
JFP
2007
136views more  JFP 2007»
13 years 7 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
SIAMNUM
2011
144views more  SIAMNUM 2011»
13 years 2 months ago
Continuous Mesh Framework Part II: Validations and Applications
This paper gives a numerical validation of the continuous mesh framework introduced in Part I [23]. We numerically show that the interpolation error can be evaluated analytically o...
Adrien Loseille, Frédéric Alauzet
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri