Sciweavers

364 search results - page 30 / 73
» A benchmark for the sorting network problem
Sort
View
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
14 years 1 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
CDC
2008
IEEE
14 years 2 months ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
CPAIOR
2011
Springer
12 years 12 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
NIPS
2008
13 years 9 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey
TNN
2008
181views more  TNN 2008»
13 years 8 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu