Sciweavers

4894 search results - page 544 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
NA
2007
105views more  NA 2007»
15 years 4 months ago
Orthogonal projection regularization operators
Abstract. Tikhonov regularization often is applied with a finite difference regularization operator that approximates a low-order derivative. This paper proposes the use of ortho...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
JGO
2010
138views more  JGO 2010»
15 years 3 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...
MOR
2010
106views more  MOR 2010»
15 years 3 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...
TALG
2010
101views more  TALG 2010»
15 years 3 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
TCS
2010
15 years 3 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin