2485 search results - page 100 / 497 » Time Bounded Frequency Computations |
165
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
150
Voted
DAC
2005
ACM
15 years 6 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
146
click to vote
POPL
1996
ACM
15 years 8 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
147
click to vote
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
147
Voted
SIAMDM
2010
14 years 11 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...