Sciweavers

2089 search results - page 126 / 418
» Finding Environment Guarantees
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 5 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
AAAI
1994
15 years 5 months ago
A Computational Market Model for Distributed Configuration Design
This paper presents a precise market model for a well-defined class of distributed configuration design problems. Given a design problem, the model defines a computational economy...
Michael P. Wellman
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 4 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
114
Voted
AMC
2006
75views more  AMC 2006»
15 years 4 months ago
Common stabilizers for linear control systems in the presence of actuators outage
This paper presents common stabilizers for linear control systems when actuators happen to fail. The possible outage of actuators examined in this study are not confined to a pre-s...
Yew-Wen Liang, Der-Cherng Liaw
ENTCS
2008
97views more  ENTCS 2008»
15 years 4 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann