Sciweavers

1972 search results - page 157 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
99
Voted
LFP
1990
73views more  LFP 1990»
15 years 3 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
ICML
2010
IEEE
15 years 3 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
WWW
2004
ACM
16 years 3 months ago
Optimization of html automatically generated by wysiwyg programs
Automatically generated HTML, as produced by WYSIWYG programs, typically contains much repetitive and unnecessary markup. This paper identifies aspects of such HTML that may be al...
Jacqueline Spiesser, Les Kitchen
POPL
2002
ACM
16 years 2 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper
130
Voted
ICSM
2000
IEEE
15 years 6 months ago
ConSIT: A Conditioned Program Slicer
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...
Chris Fox, Mark Harman, Robert M. Hierons, Sebasti...