179 search results - page 18 / 36 » Lazy Evaluation for OCL |
108
click to vote
IFL
2005
Springer
15 years 7 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
104
click to vote
NIPS
2004
15 years 3 months ago
2004
Classification algorithms typically induce population-wide models that are trained to perform well on average on expected future instances. We introduce a Bayesian framework for l...
134
click to vote
AIR
2005
15 years 1 months ago
2005
Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work...
163
click to vote
WCFLP
2005
ACM
15 years 7 months ago
2005
ACM
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
126
click to vote
PADO
2001
Springer
15 years 6 months ago
2001
Springer
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...