4894 search results - page 493 / 979 » The Guarding Problem - Complexity and Approximation |
139
click to vote
IJON
2007
15 years 5 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
164
click to vote
TON
2008
15 years 5 months ago
2008
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...
128
Voted
NN
1998
Springer
15 years 4 months ago
1998
Springer
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...
140
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
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 ...
141
click to vote
OL
2007
15 years 4 months ago
2007
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...