4719 search results - page 207 / 944 » Newtonian program analysis |
114
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
105
click to vote
VMCAI
2005
Springer
15 years 10 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
121
click to vote
ICMLA
2007
15 years 6 months ago
2007
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
134
click to vote
ENTCS
2006
15 years 4 months ago
2006
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
144
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...