734 search results - page 108 / 147 » Dynamic programming for impulse controls |
DEEC
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. Engineering workflow applications are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interac...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
AAAI
1994
13 years 9 months ago
1994
Between sensing the world after every action (as in a reactive plan) and not sensing at all (as in an openloop plan), lies a continuum of strategies for sensing during plan execut...
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...