Sciweavers

4843 search results - page 482 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
TON
2008
98views more  TON 2008»
15 years 6 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
NN
1998
Springer
15 years 6 months ago
Multilayer neural networks and Bayes decision theory
There are many applications of multilayer neural networks to pattern classification problems in the engineering field. Recently, it has been shown that Bayes a posteriori probab...
Ken-ichi Funahashi
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
15 years 5 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
OL
2007
156views more  OL 2007»
15 years 5 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
FOCM
2010
100views more  FOCM 2010»
15 years 4 months ago
Higher-Order Averaging, Formal Series and Numerical Integration I: B-series
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...
P. Chartier, A. Murua, J. M. Sanz-Serna