1951 search results - page 113 / 391 » An algorithm for improving graph partitions |
140
click to vote
IAT
2008
IEEE
15 years 11 months ago
2008
IEEE
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
140
click to vote
JHSN
2007
15 years 4 months ago
2007
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
178
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
119
click to vote
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
134
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we present a novel volumetric shape from silhouette algorithm based on a centripetal pentahedron model. The algorithm first partitions the space with a set of infini...