A Highly Scalable Solution of an NP-Complete Problem Using CUDA.
Saiyedul IslamRaghav TandonShashank SinghAlok MisraPublished in: PARELEC (2011)
Keyphrases
- highly scalable
- np complete
- randomly generated
- data partitioning
- web caching
- np hard
- databases
- search algorithm
- computational complexity
- constraint satisfaction problems
- satisfiability problem
- learning algorithm
- linear equations
- data sets
- query processing
- optimal solution
- database systems
- conjunctive queries
- integer programming
- case study