4372 search results - page 359 / 875 » Algorithmic Theories of Everything |
208
click to vote
TVLSI
2002
15 years 6 months ago
2002
: Clock networks account for a significant fraction of the power dissipation of a chip and are critical to performance. This paper presents theory and algorithms for building a low...
203
click to vote
KI
2008
Springer
15 years 5 months ago
2008
Springer
The research aim of this paper is to represent everydaylife patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is inv...
182
click to vote
JGO
2010
15 years 5 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
163
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
138
click to vote
SIGDIAL
2010
15 years 4 months ago
2010
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...