12373 search results - page 429 / 2475 » Semi-Logarithmic Number Systems |
197
click to vote
ATAL
2004
Springer
16 years 1 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
201
click to vote
ESWS
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
178
click to vote
SPAA
2003
ACM
16 years 27 days ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
203
click to vote
SPAA
2000
ACM
16 years 18 hour ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
188
click to vote
GD
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...