Sciweavers

5863 search results - page 124 / 1173
» Calculating Functional Programs
Sort
View
JCT
2000
103views more  JCT 2000»
15 years 2 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
HASKELL
2005
ACM
15 years 8 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons
HICSS
1999
IEEE
72views Biometrics» more  HICSS 1999»
15 years 6 months ago
Software Reliability as a Function of User Execution Patterns
Assessing the reliability of a software system has always been an elusive target. A program may work very well for a number of years and this same program may suddenly become quit...
John C. Munson, Sebastian G. Elbaum
ICA3PP
2010
Springer
15 years 4 months ago
Function Units Sharing between Neighbor Cores in CMP
Abstract. Program behaviors reveal that programs have different sources requirement at different phases, even at continuous clocks. It is not a reasonable way to run different prog...
Tianzhou Chen, Jianliang Ma, Hui Yuan, Jingwei Liu...
96
Voted
ICSE
2007
IEEE-ACM
16 years 2 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...