Results 11  20
of
476,936
Engineering Graph Partitioning Algorithms
"... Abstract. The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel pro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel
Randomized Graph Partitioning Algorithms
, 1997
"... In this project, we have studied and worked on results and algorithms centered around (global) minimum cuts in graphs. A cut is a minimal set of edges whose removal from a connected graph disconnects it and a minimum cut is a cut of least capacity. We analyze the combinatorial structure of the set o ..."
Abstract
 Add to MetaCart
In this project, we have studied and worked on results and algorithms centered around (global) minimum cuts in graphs. A cut is a minimal set of edges whose removal from a connected graph disconnects it and a minimum cut is a cut of least capacity. We analyze the combinatorial structure of the set
Engineering Multilevel Graph Partitioning Algorithms
"... We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining these technique ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining
Analysis of Multilevel Graph Partition Algorithm
"... All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through th ..."
Abstract
 Add to MetaCart
All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through
Convergence Properties of the Lainiotis Partition Algorithm
 Control and Computers
, 1991
"... We consider the convergence of the Lainiotis Partition Algorithm for system identiffcation. This algorithm computes a MAP model estimate of the system. It is proven that under certain weak conditions the algorithm converges to the "truest" (in a mean square error sense) model. In the cours ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We consider the convergence of the Lainiotis Partition Algorithm for system identiffcation. This algorithm computes a MAP model estimate of the system. It is proven that under certain weak conditions the algorithm converges to the "truest" (in a mean square error sense) model
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
 IEEE TRANS. PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Distributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In ge ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
, how to meet the growing requirement of bandwidth and computational resources is one of the major challenges in designing a scalable and costeffective DVE system. In this paper, we propose an efficient partitioning algorithm that addresses the scalability issue of designing a large scale DVE system
Cluster Ensembles  A Knowledge Reuse Framework for Combining Multiple Partitions
 Journal of Machine Learning Research
, 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract

Cited by 589 (21 self)
 Add to MetaCart
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse
Ants for Sampling in the Nested Partition Algorithm
"... The Nested Partition algorithm suffers from the lack of information gathering and sharing despite the computational effort dedicated to sampling the different subregions at each step of the algorithm. It is also noticed that the solution quality of the NP algorithm largely depends on the quality of ..."
Abstract
 Add to MetaCart
The Nested Partition algorithm suffers from the lack of information gathering and sharing despite the computational effort dedicated to sampling the different subregions at each step of the algorithm. It is also noticed that the solution quality of the NP algorithm largely depends on the quality
Results 11  20
of
476,936