3958 search results - page 468 / 792 » Dynamic Graph Algorithms with Applications |
187
click to vote
IJCAI
2003
15 years 8 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
175
click to vote
NIPS
2008
15 years 8 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
238
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
197
click to vote
SEBD
1997
15 years 8 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
182
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...