1725 search results - page 262 / 345 » Relaxed genetic programming |
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
151
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
112
click to vote
AOSD
2011
ACM
14 years 1 months ago
2011
ACM
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...