Sciweavers

8132 search results - page 236 / 1627
» Dependability, Abstraction, and Programming
Sort
View
AIPS
2004
15 years 8 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
SIGSOFT
2002
ACM
16 years 7 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
ICFP
2008
ACM
16 years 6 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
CISIS
2008
IEEE
16 years 1 months ago
Java and the Power of Multi-Core Processing
The new era of multi-core processing challenges software designers to efficiently exploit the parallelism that is now massively available. Programmers have to exchange the conven...
Peter Bertels, Dirk Stroobandt
VL
1996
IEEE
105views Visual Languages» more  VL 1996»
15 years 10 months ago
Composing Complex Behavior from Simple Visual Descriptions
An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however, the rules tend to be dep...
Roland Hübscher