Sciweavers

601 search results - page 59 / 121
» Quantified Equality Constraints
Sort
View
NETWORKS
2008
15 years 3 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
NPL
1998
87views more  NPL 1998»
15 years 3 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
INFOCOM
1998
IEEE
15 years 8 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
CSL
2010
Springer
15 years 5 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
BMCBI
2011
14 years 7 months ago
ShoRAH: estimating the genetic diversity of a mixed sample from next-generation sequencing data
Background: With next-generation sequencing technologies, experiments that were considered prohibitive only a few years ago are now possible. However, while these technologies hav...
Osvaldo Zagordi, Arnab Bhattacharya, Nicholas Erik...