494 search results - page 95 / 99 » Heap Building Bounds |
117
click to vote
AAAI
2008
14 years 11 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
CONEXT
2009
ACM
14 years 11 months ago
2009
ACM
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
108
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, betwe...