Sciweavers

4757 search results - page 313 / 952
» Monads for Functional Programming
Sort
View
FTCS
1998
91views more  FTCS 1998»
15 years 8 months ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen
WSC
1998
15 years 8 months ago
MPI-SIM: Using Parallel Simulation to Evaluate MPI Programs
This paper describes the design and implementation of MPI-SIM, a library for the execution driven parallel simulation of MPI programs. MPI-LITE, a portable library that supports m...
Sundeep Prakash, Rajive Bagrodia
JLP
2008
129views more  JLP 2008»
15 years 6 months ago
Program and proof optimizations with type systems
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
Ando Saabas, Tarmo Uustalu
JMLR
2006
92views more  JMLR 2006»
15 years 6 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...
PAMI
2006
164views more  PAMI 2006»
15 years 6 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero