Sciweavers

5331 search results - page 673 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 8 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
GLOBECOM
2007
IEEE
15 years 7 months ago
Path Planning for Network Performance
— Path planning and network design are often treated by architects of mobile communication networks as separate problems. In fact, most mobile ad hoc network (MANET) designs do n...
Alex Fridman, Steven Weber, Charles Graff, Moshe K...
JC
2006
61views more  JC 2006»
15 years 6 months ago
The discretized discrepancy principle under general source conditions
We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirel...
Peter Mathé, Sergei V. Pereverzev
JMLR
2006
89views more  JMLR 2006»
15 years 6 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
TWC
2008
106views more  TWC 2008»
15 years 6 months ago
Analysis of Handoff Interference and Outage along Arbitrary Trajectories in Cellular Networks
We introduce a new system performance measure due to handoff called handoff interference, which characterizes the additional interference noise induced by the handoff process. The ...
A. Leu, B. Mark, S. Tang