Sciweavers

797 search results - page 81 / 160
» Eliminating Proofs from Programs
Sort
View
PPOPP
1997
ACM
14 years 2 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
BMCBI
2005
120views more  BMCBI 2005»
13 years 10 months ago
Harshlight: a "corrective make-up" program for microarray chips
Background: Microscopists are familiar with many blemishes that fluorescence images can have due to dust and debris, glass flaws, uneven distribution of fluids or surface coatings...
Mayte Suárez-Fariñas, Maurizio Pelle...
JUCS
2008
140views more  JUCS 2008»
13 years 10 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
MOR
2002
94views more  MOR 2002»
13 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
APLAS
2009
ACM
14 years 4 months ago
On the Decidability of Subtyping with Bounded Existential Types
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann