4140 search results - page 791 / 828 » A Use Case Based Approach to Feature Models' Construction |
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
209
click to vote
POPL
2009
ACM
16 years 12 days ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
PLDI
2010
ACM
15 years 4 months ago
2010
ACM
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
213
click to vote
ICFP
2009
ACM
16 years 12 days ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...