Sciweavers

373 search results - page 66 / 75
» On Deterministic Approximation of DNF
Sort
View
IPL
2008
114views more  IPL 2008»
13 years 7 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
TCBB
2008
126views more  TCBB 2008»
13 years 7 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
AUTOMATICA
2004
112views more  AUTOMATICA 2004»
13 years 7 months ago
Ellipsoidal parameter or state estimation under model uncertainty
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
Boris T. Polyak, Sergey A. Nazin, Cécile Du...
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
ML
2002
ACM
220views Machine Learning» more  ML 2002»
13 years 7 months ago
Bayesian Methods for Support Vector Machines: Evidence and Predictive Class Probabilities
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...
Peter Sollich