Sciweavers

12148 search results - page 383 / 2430
» Generalized Bundle Methods
Sort
View
FOCS
2006
IEEE
16 years 1 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
SAC
2006
ACM
16 years 1 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
IFM
2005
Springer
16 years 1 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
COLT
1998
Springer
15 years 11 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
ISMIS
2000
Springer
15 years 11 months ago
A Comparative Study of Noncontextual and Contextual Dependencies
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, ...
S. K. Michael Wong, Cory J. Butz