7006 search results - page 1185 / 1402 » Approximation Algorithms |
156
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
163
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
191
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we describe an unsupervised learning framework to segment a scene into semantic regions and to build semantic scene models from longterm observations of mo...
157
click to vote
AAAI
2007
15 years 8 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
132
click to vote
IJCAI
2007
15 years 7 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...