Sciweavers

7978 search results - page 456 / 1596
» Combining shared-coin algorithms
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
16 years 23 days ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICDM
2005
IEEE
179views Data Mining» more  ICDM 2005»
16 years 12 days ago
Bagging with Adaptive Costs
Ensemble methods have proved to be highly effective in improving the performance of base learners under most circumstances. In this paper, we propose a new algorithm that combine...
Yi Zhang, W. Nick Street
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
16 years 10 days ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
Thomas Schlichter, Christian Haubelt, Jürgen ...
KES
2005
Springer
16 years 9 days ago
Generalized Composite Motif Discovery
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
Geir Kjetil Sandve, Finn Drabløs
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
16 years 6 days ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...