Sciweavers

543 search results - page 40 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
GLVLSI
2003
IEEE
147views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Clustering based acyclic multi-way partitioning
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...
Eric S. H. Wong, Evangeline F. Y. Young, Wai-Kei M...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 3 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
ATAL
2010
Springer
13 years 9 months ago
Coalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
Bikramjit Banerjee, Landon Kraemer
CVPR
2001
IEEE
14 years 10 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
IPPS
2006
IEEE
14 years 2 months ago
Towards a parallel framework of grid-based numerical algorithms on DAGs
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
Zeyao Mo, Aiqing Zhang, Xiaolin Cao