269 search results - page 28 / 54 » A branch and bound method for stochastic global optimization |
84
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
DAGSTUHL
2008
14 years 11 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
70
Voted
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
CEC
2008
IEEE
14 years 10 months ago
2008
IEEE
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...