Sciweavers

1453 search results - page 143 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 2 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 9 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
AGENTS
1999
Springer
14 years 1 months ago
General Principles of Learning-Based Multi-Agent Systems
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...
David Wolpert, Kevin R. Wheeler, Kagan Tumer
3DPVT
2004
IEEE
188views Visualization» more  3DPVT 2004»
14 years 29 days ago
3D Shape Registration using Regularized Medial Scaffolds
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...
MM
2010
ACM
186views Multimedia» more  MM 2010»
13 years 9 months ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau