5757 search results - page 885 / 1152 » Dynamic Policy Programming |
91
Voted
STOC
2005
ACM
16 years 28 days ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
PERCOM
2004
ACM
16 years 6 days ago
2004
ACM
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...
105
Voted
HRI
2010
ACM
15 years 7 months ago
2010
ACM
—Robots are poised to enter our everyday environments such as our homes and offices, contexts that present unique questions such as the style of the robot’s actions. Style-orie...
103
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...