1236 search results - page 206 / 248 » Programming by Demonstration for Information Agents |
100
click to vote
AIPS
2000
15 years 13 days ago
2000
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
100
click to vote
ATAL
2005
Springer
15 years 4 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
82
Voted
ICRA
2003
IEEE
15 years 4 months ago
2003
IEEE
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
TAPSOFT
1995
Springer
15 years 2 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...