7150 search results - page 1100 / 1430 » An Approximation Algorithm for Approximation Rank |
169
click to vote
ASM
2004
ASM
16 years 2 days ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
191
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
193
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
189
click to vote
CIKM
2003
Springer
15 years 12 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
190
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...