707 search results - page 74 / 142 » Solving path problems on the GPU |
CCR
2000
14 years 11 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
103
click to vote
DATE
2000
IEEE
15 years 4 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
SOFSEM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
100
click to vote
ECAL
2003
Springer
15 years 5 months ago
2003
Springer
Fractal proteins are a new evolvable method of mapping genotype to phenotype through a developmental process, where genes are expressed into proteins comprised of subsets of the Ma...
INFOCOM
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...