3928 search results - page 105 / 786 » Optimal suffix selection |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
EUSFLAT
2009
2009
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
13 years 8 months ago
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
AMC
2005
13 years 10 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...