Sciweavers

543 search results - page 42 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 8 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
NIPS
2004
13 years 9 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
EGH
2004
Springer
13 years 11 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
14 years 2 months ago
Closing a Million-Landmarks Loop
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
Udo Frese, Lutz Schroder