Sciweavers

6149 search results - page 572 / 1230
» Revealing the programming process
Sort
View
AGP
1995
IEEE
15 years 10 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
FPCA
1995
15 years 10 months ago
Bananas in Space: Extending Fold and Unfold to Exponential Types
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
Erik Meijer, Graham Hutton
TOOLS
1991
IEEE
15 years 10 months ago
INGRID - an Object-Oriented Interface Builder
After a maturing process where models and architectures for User Interface Systems have been dened and generally accepted, the current expectations of researchers, developers and ...
Luís Carriço, Nuno Guimarães,...
AAAI
2006
15 years 8 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
AIPS
2006
15 years 8 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht