3820 search results - page 62 / 764 » Bounded Model Debugging |
SWAT
1994
Springer
14 years 2 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
The capacity assignment (CA) problem is one of the most essential yet important topics in packet communication networks. However, most reported CA models were established under the...
JSYML
2010
13 years 4 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We compare static arbitrage price bounds on basket calls, i.e. bounds that only involve buy-and-hold trading strategies, with the price range obtained within a multivariate genera...
ACL
2006
13 years 11 months ago
2006
This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext ...