4372 search results - page 397 / 875 » Algorithmic Theories of Everything |
173
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
177
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
165
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
337
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
165
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...