8232 search results - page 1342 / 1647 » Dynamic Logic Programming |
156
click to vote
STOC
2005
ACM
16 years 7 months 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, ...
156
click to vote
PERCOM
2004
ACM
16 years 6 months 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...
164
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
167
click to vote
HRI
2010
ACM
16 years 1 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...
192
click to vote
WEA
2010
Springer
16 years 1 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...