Sciweavers

1603 search results - page 24 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 3 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 1 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
SIAMSC
2008
139views more  SIAMSC 2008»
14 years 10 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
AMC
1999
102views more  AMC 1999»
14 years 9 months ago
Analysis and approximation of optimal control problems for first-order elliptic systems in three dimensions
We examine analytical and numerical aspects of optimal control problems for firstorder elliptic systems in three dimensions. The particular setting we use is that of divcurl syste...
Max Gunzburger, Hyung-Chun Lee