427 search results - page 9 / 86 » A Subexponential Bound for Linear Programming |
ICALP
2010
Springer
14 years 12 days ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
AIPS
2007
13 years 10 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
AAIM
2006
Springer
13 years 11 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
ORL
2007
13 years 7 months ago
2007
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...