Sciweavers

1359 search results - page 49 / 272
» Black-Box Program Specialization
Sort
View
LOPSTR
1994
Springer
14 years 23 days ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
WFLP
2000
Springer
163views Algorithms» more  WFLP 2000»
14 years 7 days ago
Cooperative Constraint Functional Logic Programming
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
Mircea Marin, Tetsuo Ida
AAAI
2008
13 years 11 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
AAAI
2004
13 years 10 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
SCM
1998
13 years 10 months ago
Coordinated Editing of Versioned Packages in the JP Programming Environment
As part of an investigation of scalable development techniques for systems written in the JavaTM programming language, the Forest Project is building JP, a prototype distributed pr...
Michael L. Van de Vanter