3838 search results - page 303 / 768 » Techniques for Optimization of Net Algorithms |
158
click to vote
ICC
2008
IEEE
16 years 19 days ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
121
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
155
click to vote
CPHYSICS
2010
15 years 6 months ago
2010
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
173
click to vote
IPL
1998
15 years 5 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
163
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...