1332 search results - page 132 / 267 » Combinatorial Algorithms |
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...