832 search results - page 57 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
ATVA
2005
Springer
15 years 3 months ago
2005
Springer
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...