Sciweavers

14158 search results - page 76 / 2832
» Generalized switch-setting problems
Sort
View
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
ICSM
2009
IEEE
13 years 7 months ago
Visualizing the structure of field testing problems
Field testing of a software application prior to general release is an important and essential quality assurance step. Field testing helps identify unforeseen problems. Extensive ...
Brian Chan, Ying Zou, Ahmed E. Hassan, Anand Sinha
NETWORKS
2010
13 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
SIAMSC
2010
108views more  SIAMSC 2010»
13 years 8 months ago
Goal-Oriented Error Estimation and Adaptivity for Free-Boundary Problems: The Shape-Linearization Approach
Abstract. We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appro...
K. G. van der Zee, E. H. van Brummelen, R. de Bors...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 5 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...