2430 search results - page 394 / 486 » Computing Tutte Polynomials |
122
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
122
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
124
click to vote
IMA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
104
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
133
click to vote
MATES
2005
Springer
15 years 8 months ago
2005
Springer
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for dec...