1139 search results - page 10 / 228 » Bounded Ideation Theory |
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper explores the use of SAT-Modulo Theory in determination of bit-widths for finite precision implementation of numerical calculations, specifically in the context of sci...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
The inequations of the delays of the asynchronous circuits are written, by making use of pseudo-Boolean differential calculus. We consider these efforts to be a possible starting p...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...