Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

DNA
2001
Springer

favoriteEmaildiscussreport

83views Bioinformatics» more DNA 2001»

Solving Knapsack Problems in a Sticker Based Model

14 years 3 months ago

Solving Knapsack Problems in a Sticker Based Model

Download www.cs.us.es

Mario J. Pérez-Jiménez, Fernando San

Real-time Traffic

Bioinformatics | DNA 2001 |

claim paper

Related Content

» A StickerBased Model for DNA Computation

» Approximated Consistency for Knapsack Constraints

» The Practice of Approximated Consistency for Knapsack Constraints

» Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

» Extending Dantzigs bound to the bounded multipleclass binary Knapsack problem

» Algorithm for stochastic multiplechoice knapsack problem and application to keywords biddi...

» Approximate and exact algorithms for the fixedcharge knapsack problem

» The Accuracy of Search Heuristics An Empirical Study on Knapsack Problems

» Cheating for problem solving a genetic algorithm with social interactions

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	DNA
Authors	Mario J. Pérez-Jiménez, Fernando Sancho-Caparrini

Comments (0)