2681 search results - page 444 / 537 » Problem F |
DAC
2001
ACM
16 years 24 days ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
102
click to vote
SIGSOFT
2006
ACM
16 years 17 days ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
KDD
2005
ACM
16 years 7 days ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
207
click to vote
POPL
2008
ACM
16 years 4 days ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
114
click to vote
STOC
2005
ACM
16 years 4 days ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...