Sciweavers

3818 search results - page 120 / 764
» Word Problems on Compressed Words
Sort
View
APJOR
2010
112views more  APJOR 2010»
15 years 5 months ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
142
Voted
AUTOMATICA
2008
90views more  AUTOMATICA 2008»
15 years 5 months ago
Average consensus problems in networks of agents with delayed communications
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. By focusing on agents with integrato...
Pierre-Alexandre Bliman, Giancarlo Ferrari-Trecate
DAM
2006
191views more  DAM 2006»
15 years 5 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
SIAMJO
2008
76views more  SIAMJO 2008»
15 years 4 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
132
Voted
4OR
2004
99views more  4OR 2004»
15 years 4 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg