Sciweavers

2738 search results - page 530 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
ATAL
2006
Springer
13 years 10 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
ATAL
2006
Springer
13 years 10 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
COLT
2004
Springer
13 years 10 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
FQAS
2006
Springer
101views Database» more  FQAS 2006»
13 years 10 months ago
Cooperative Discovery of Interesting Action Rules
Action rules introduced in [12] and extended further to e-action rules [21] have been investigated in [22], [13], [20]. They assume that attributes in a database are divided into t...
Agnieszka Dardzinska, Zbigniew W. Ras
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 10 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith