Sciweavers

3019 search results - page 599 / 604
» Approximating the Domatic Number
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
NN
2002
Springer
115views Neural Networks» more  NN 2002»
13 years 8 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 8 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
SIGMETRICS
2002
ACM
13 years 8 months ago
Quality of service evaluations of multicast streaming protocols
Recently proposed scalable on-demand streaming protocols have previously been evaluated using a system cost measure termed the "required server bandwidth". For the scala...
Haonan Tan, Derek L. Eager, Mary K. Vernon, Hongfe...