738 search results - page 126 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICDCN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
SPAA
1997
ACM
15 years 1 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
118
click to vote
IMC
2010
ACM
14 years 7 months ago
2010
ACM
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...