10608 search results - page 426 / 2122 » Complexity of O'Hara's Algorithm |
143
click to vote
ROBOCUP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
129
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
177
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
127
click to vote
VVS
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
118
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...