Sciweavers

1569 search results - page 60 / 314
» Programming contest strategy
Sort
View
ICFP
2009
ACM
14 years 10 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
HPCN
1997
Springer
14 years 2 months ago
An Application-Level Dependable Technique for Farmer-Worker Parallel Programs
An application-level technique is described for farmer-worker parallel applications which allows a worker to be added or removed from the computing farm at any moment of the run ti...
Vincenzo De Florio, Geert Deconinck, Rudy Lauwerei...
LOPSTR
2004
Springer
14 years 3 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...
UM
2001
Springer
14 years 2 months ago
Utility-Based Decision Tree Optimization: A Framework for Adaptive Interviewing
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
Markus Stolze, Michael Ströbel
POS
2000
Springer
14 years 1 months ago
The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
Nicolas Richer, Marc Shapiro