9842 search results - page 1655 / 1969 » The Complexity of the Matching-Cut Problem |
178
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
199
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
193
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
160
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
187
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...