2569 search results - page 103 / 514 » Approximate Objects and Approximate Theories |
184
click to vote
FSTTCS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
166
click to vote
FOCS
2007
IEEE
16 years 21 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
126
click to vote
ISSTA
2006
ACM
16 years 9 days ago
2006
ACM
This paper extends basic software-testing theory to software components and adds explicit state to the theory. The resulting theory e enough to abstractly model the construction o...
168
click to vote
SEFM
2006
IEEE
16 years 11 days ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
182
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...