130 search results - page 20 / 26 » Secretary Problems via Linear Programming |
ICNSC
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, a variance constrained filtering problem is considered for systems with both non-Gaussian noises and polytopic uncertainty. A novel filter is developed to estimate t...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
ASPDAC
2004
ACM
14 years 28 days ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...