Sciweavers

1772 search results - page 103 / 355
» Classifying Problems into Complexity Classes
Sort
View
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 3 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
139
Voted
IAT
2009
IEEE
15 years 6 months ago
Confusion and Distance Metrics as Performance Criteria for Hierarchical Classification Spaces
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
Wilbert van Norden, Catholijn M. Jonker
FCT
2005
Springer
15 years 8 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
118
Voted
AAAI
2006
15 years 4 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
90
Voted
ESANN
2006
15 years 4 months ago
Data mining techniques for feature selection in blood cell recognition
The paper presents and compares the data mining techniques for selection of the diagnostic features in the problem of blood cell recognition in leukemia. Different techniques are c...
Tomasz Markiewicz, Stanislaw Osowski