4716 search results - page 184 / 944 » Iterative-free program analysis |
101
Voted
STOC
2004
ACM
16 years 2 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...
86
Voted
VMCAI
2005
Springer
15 years 8 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 ï...
105
Voted
ICMLA
2007
15 years 4 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...
117
click to vote
ENTCS
2006
15 years 2 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...
155
click to vote
GECCO
2009
Springer
15 years 12 days ago
2009
Springer
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...