1613 search results - page 218 / 323 » Functional and Constraint Logic Programming |
153
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
157
click to vote
PLDI
2010
ACM
16 years 2 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
171
click to vote
ESOP
2009
Springer
16 years 6 days ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
131
click to vote
CC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
145
click to vote
DAC
2003
ACM
16 years 6 months ago
2003
ACM
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...