5506 search results - page 504 / 1102 » Minimal Logic Programs |
200
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
189
click to vote
DRM
2007
Springer
16 years 1 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
213
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
206
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
192
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...