336 search results - page 58 / 68 » Analytic Cut Trees |
JAIR
2007
13 years 7 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
Although it is commonly assumed that the use of topology control can improve the throughput capacity of wireless networks, analytical results on this topic are sometimes contradic...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...