5757 search results - page 888 / 1152 » Dynamic Policy Programming |
96
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
108
Voted
SAMOS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, we present a particularly lightweight, integrative approach to programming and executing applications targeting heterogeneous, dynamically reconfigurable ...
89
Voted
SOCO
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
113
click to vote
CIMCA
2008
IEEE
15 years 7 months ago
2008
IEEE
Online auctions have become extremely popular in recent years. Ability to predict winning bid prices accurately can help bidders to maximize their profit. This paper proposes a nu...
110
Voted
FGR
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose methods for segmenting a motion sequence into motion primitives, taking into account temporal constraints (continuity along the time axis). In the proposed methods, dyn...