1184 search results - page 93 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
113
click to vote
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
145
click to vote
CONCUR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system....
112
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
120
Voted
WSC
2008
15 years 4 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
144
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...